首页> 外文会议>International Conference on Integer Programming and Combinatorial Optimization >New Exact Techniques Applied to a Class of Network Flow Formulations
【24h】

New Exact Techniques Applied to a Class of Network Flow Formulations

机译:应用于一类网络流制剂的新精确技术

获取原文

摘要

We propose a number of solution techniques for general network flow formulations derived from Dantzig-Wolfe decompositions. We present an arc selection method to derive reduced network flow models that may potentially provide good feasible solutions. This method is explored as a variable selection rule for branching. With the aim of improving reduced-cost variable-fixing, we also propose a method to produce different dual solutions of network flow models and provide conditions that guarantee the correctness of the method. We embed the proposed techniques in an innovative branch-and-price method for network flow formulations, and test it on the cutting stock problem. In our computational experiments, 162 out of 237 open benchmark instances are solved to proven optimality within a reasonable computational time, consistently improving previous results in the literature.
机译:我们提出了许多用于衍生自Dantzig-Wolfe分解的通用网络流制剂的解决方案技术。 我们提出了一种弧形选择方法,可以推导出可能提供良好可行解决方案的网络流模型。 此方法被探索为分支的变量选择规则。 旨在提高降低成本的可变定影,我们还提出了一种生产网络流模型的不同双解的方法,并提供保证方法的正确性的条件。 我们以创新的分支和价格方法嵌入了网络流制剂的创新分支和价格方法,并在切割股票问题上进行测试。 在我们的计算实验中,237个开放基准实例中的162个被解决,以便在合理的计算时间内验证最佳状态,始终如一地改善文献中的先前结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号