期刊文献+

关于整数线性规划代理对偶间隙的注记 被引量:2

The Methods for Closing Surrogate Dual GAP in Integer Linear Programs
原文传递
导出
摘要 将有效不等式的概念应用于整数线性规划的代理对偶问题 ,给出弥合整数线性规划的代理对偶间隙的方法 .数值例子表明所给出的方法在改进定界结果方面是有效的 . The valid inequalities is applied to surrogate duality in integer programs.The idea for closing surrogate dual gap is presented.Numerical example shows that the methods given in the paper is effecitive on stronger bounding properties.
出处 《系统工程理论与实践》 EI CSCD 北大核心 2002年第9期70-73,83,共5页 Systems Engineering-Theory & Practice
基金 国防科技预研跨行业基金 (0 0 J6.4.2 .JB3 80 4)
关键词 整数线性规划 代理对偶间隙 注记 integer linear programs surrogate duality dual gap
  • 相关文献

参考文献2

二级参考文献3

共引文献5

同被引文献23

  • 1倪明放,徐南荣.求解整数规划代理对偶的一个新方法[J].计算数学,1993,15(2):156-164. 被引量:4
  • 2周晓云,钱士茹,陈静,倪明放.企业家人力资源培训问题的整数规划模型[J].运筹与管理,2007,16(2):149-153. 被引量:4
  • 3Balas E, Ceria S, Cornuejols G, Natraj N. Gemory cuts revisited[J]. Operations Research Letters,1996,19:1-9.
  • 4Ceria S, Cordier C, Marchand H, Wolsey L A. Cutting planes for integer programs with general integer variables[J]. Mathematical Programming, 1998,81 : 201-214.
  • 5Padberg M W, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems[J]. SIAM Review, 1991, 33: 60-100.
  • 6Balas E, Zemel E. Facets of the knapsack polytope from minimal covers [J]. SIAM Journal on Applied Mathematics, 1978,34 : 119-148.
  • 7Nemhauser G L, Wolsey L A. Integer and Combinatorial Optimization[M]. John Wiley and Sons, New York, N Y,1988.
  • 8Padberg M W. A note on zero-one programming[J]. Operations Research, 1975, 23.. 833-837.
  • 9Zemel E. Easily computable facets of the knapsack polytope[J]. Mathematics of Operations Research, 1989,14: 760-765.
  • 10Gu Z, Nemhauser G L, Savelsbergh M W P. Sequence independent lifting in mixed-integer programming[J]. Journal of Combinatorial Optimization, 2000,4 : 109-129.

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部