...
首页> 外文期刊>ORSA Journal on Computing >Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
【24h】

Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem

机译:模板设计问题的整数线性规划和约束规划方法

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

摘要

We describe a design problem arising in the color printing industry and discuss a number of integer linear programming and constraint programming approaches to its solution. Despite the apparent simplicity of the problem it presents a challenge for both approaches. We present results for three typical cases and show that the constraint programming approach provides better results, although in some cases after considerable handcrafting. We also show that the results obtained by constraint programming can be improved by a simple goal programming model.
机译:我们描述了彩色印刷行业中出现的设计问题,并讨论了许多整数线性规划和约束规划方法来解决该问题。尽管问题看起来很简单,但是这对两种方法都提出了挑战。我们给出了三种典型情况的结果,并表明约束编程方法提供了更好的结果,尽管在某些情况下需要大量的手工。我们还表明,通过简单的目标规划模型可以改善约束规划获得的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号