• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Mixed-Integer Linear Programming Problem which is Efficiently Solvable
【24h】

Mixed-Integer Linear Programming Problem which is Efficiently Solvable

机译：可有效解决的混合整数线性规划问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Much research has centered on the problem of finding shortest paths in graphs. It is well known that there is a direct correspondence between the single source shortest-paths problem and the following simple linear programming problems: Let S be a set of linear inequalities of the form x sub j - x sub i < or = (a sub ij, where the x sub i are unknowns and the a sub ij are given real constants. Determine a set of values for the x sub i such that the inequalities in S are satisfied, or determine that no such values exist. This paper considers the mixed-integer linear programming variant of this problem in which some (but not necessarily all) of the x sub i are required to be integers. The problem arises in the context of synchronous circuit optimization but it has applications to PERT scheduling and VLSI layout compaction as well. Keywords: Algorithms, Combinatorial optimization.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号