期刊文献+

两个变量的整数规划的两种局部寻优法

下载PDF
导出
摘要 所有变量都限制为非负整数的线性规划为整数规划.给出了两个变量的整数规划的两种局部寻优法:图解枚举法和贪婪枚举法.
作者 梁作松
出处 《辽宁师专学报(自然科学版)》 2009年第3期12-13,93,共3页 Journal of Liaoning Normal College(Natural Science Edition)
  • 相关文献

参考文献4

二级参考文献20

  • 1高培旺.A new heuristic algorithm for general integer linear programming problems[J].Journal of Chongqing University,2006,5(3):170-174. 被引量:1
  • 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.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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