首页> 外文期刊>Graphs and Combinatorics >MIPping Closures: An Instant Survey
【24h】

MIPping Closures: An Instant Survey

机译:MIP封包:即时调查

获取原文
获取原文并翻译 | 示例
       

摘要

A relevant amount of work has been devoted very recently to modeling and (heuristically) solving the NP-hard separation problem of famous classes of valid inequalities for mixed integer linear programs (MIPs). This task has been accomplished by using, in turn, mixed-integer linear models for the separation problem, and a general-purpose solver to actually find violated cuts—the so-called MIPping approach. We instantly survey these attempts by discussing their computational outcome and pointing out their practical interest for future integration in the MIP solvers.
机译:最近,已经投入了大量工作来建模和(启发式地)解决混合整数线性程序(MIP)的有效不等式的著名类的NP硬分离问题。通过依次使用混合整数线性模型解决分离问题以及使用通用求解器来实际发现违规切割(即所谓的MIPping方法),可以完成此任务。我们通过讨论它们的计算结果并指出它们对将来在MIP求解器中集成的实际兴趣,来立即调查这些尝试。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号