Fifty Years of Integer Programming: A Review of the Solution Approaches:

作者: Santosh Kumar , Monga K. Luhandjula , Elias Munapo , Brian C. Jones

DOI: 10.1177/097324701000600301

关键词: Branch and boundEconomic problemMathematical optimizationRandom searchInteger programmingBranch and cutBranch and priceComputer scienceFuzzy logicHeuristics

摘要: Many scientific, industrial engineering and economic problems may be cast into an integer-programming model. This paper attempts to review various approaches that have been developed for solving th...

参考文章(59)
Celso C. Ribeiro, Pierre Hansen, Essays and Surveys in Metaheuristics Kluwer Academic Publishers. ,(2002) , 10.1007/978-1-4615-1507-4
Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi, Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]. pp. 157- 222 ,(2000) , 10.1007/3-540-45586-8_5
David B. Fogel, Zbigniew Michalewicz, How to Solve It: Modern Heuristics ,(2004)
Wilbert E. Wilhelm, A Technical Review of Column Generation in Integer Programming Optimization and Engineering. ,vol. 2, pp. 159- 200 ,(2001) , 10.1023/A:1013141227104
Jakob Puchinger, Günther R. Raidl, Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. ,vol. 3562, pp. 41- 53 ,(2005) , 10.1007/11499305_5
E.M.L. Beale, Branch and Bound Methods for Mathematical Programming Systems Annals of discrete mathematics. ,vol. 5, pp. 201- 219 ,(1979) , 10.1016/S0167-5060(08)70351-0
C. Privault, L. Herault, Solving a Real World Assignment Problem with a Metaheuristic Journal of Heuristics. ,vol. 4, pp. 383- 398 ,(1998) , 10.1023/A:1009618009594
Ralph E. Gomory, Ellis L. Johnson, Some continuous functions related to corner polyhedra Mathematical Programming. ,vol. 3-3, pp. 23- 85 ,(1972) , 10.1007/BF01584976
Karla L. Hoffman, Manfred Padberg, Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut Informs Journal on Computing. ,vol. 3, pp. 121- 134 ,(1991) , 10.1287/IJOC.3.2.121