[1] |
卢开澄.组合数学(第2版)[M].北京:清华大学出版社,1999.
|
[2] |
聂义勇,贵刚,宋翔.整数规划基础[M].沈阳:东北大学出版社,2001.
|
[3] |
马仲蕃.线性整数规划的数学基础[M].北京:科学出版社,1998
|
[4] |
Smale S. On the average number of step of the simplex method of linear programming [J]. Mathematical Programming, 1983,27(3):241~262.
|
[5] |
Karmarkar N. A new polynomial-time algorithm for linear programming [J]. Combinatorics, 1984,4: 373~395.
|
[6] |
马仲蕃.线性规划最新进展[M].北京:科学出版社,1994.
|
[7] |
Nie Y Y, Xu S R. An isometric plane method for linear programming [J]. Journal of Computational Mathematics, 1991,9 (3):262~272.
|
[8] |
Nie Y Y, Su L J, Li C. An isometric surface method for integer linear programming [J]. International Journal of Computer Mathematics, 2003,80(7):835~844.
|
[9] |
Chvatal V. Edmonds polytopes and weakly Hamilton graphs [J].Mathematical Programming, 1973,5 (1):29~40.
|
[10] |
Dantzig G B, Fulkerson R, Johnson S M. Solution for a largescale traveling salesman problem [J]. Operations Research,1954,2: 393~410.
|
[11] |
张文修,梁怡.遗传算法的数学基础(第2版)[M].西安:西安交通大学出版社,2003.
|
[12] |
宋翔,聂义勇,储诚斌.无限制背包问题的爬山算法[J].小型微型计算机系统,2004,25(7):1352~1355.
|
[13] |
Balas E, Zemel E. An algorithm for large zero-one knapsack problems [J]. Operations Research, 1980,28 (3): 1130~1154.
|
[14] |
Chvatal V. Hard knapsack problems [J]. Operations Research,1980, 28(6):1402~1411.
|
[15] |
Nie Y Y, Song X, Gui G. Incompletely enumerative solution for 1 D cutting-stock problem [J]. Far East Journal of Mathematical Sciences (FJMS), 2002, 5 (1):25~46.
|
[16] |
Nie Y Y, Yu J, Song X. Incompletely enumerative solution for 1D cutting-stock problem Ⅱ [J]. Far East Journal of Mathematical Sciences (FJMS), 2004, 12(1):53~64.
|