Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

European Journal of Operational Research

Volumn 125, Issue 2, 2000, Pages 222-238

  Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BRANCH-AND-BOUND ALGORITHMS; BRANCH-AND-CUT ALGORITHMS; BRANCH-AND-PRICE ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 0033706472     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00453-1     Document Type: Article

References (67)

1. D. Applegate, R.E. Bixby, V. Chvátal, W. Cook, Finding cuts in the TSP (a preliminary report), Tech. Report 95-05, DIMACS, Rutgers University, New Brunswick, NJ, 1995.
2. E. Balas, The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph, SIAM Journal on Discrete Mathematics (1989) 425-451.
3. Balas E., Christofides N. A restricted Lagrangian approach to the traveling salesman problem. Mathematical Programming. 21:1981;19-46.
4. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Operations Research. 28:1980;1130-1154.
5. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H. Branch-and-price: Column generation for solving huge integer programs. Operations Research. 46:1998;316-329.
6. Bellman R.E. Dynamic Programming. 1957;Princeton University Press, Princeton, NJ.
7. Bellmore M., Malone J.C. Pathology of traveling salesman subtour elimination algorithms. Operations Research. 19:1971;278-307.
8. Camerini P.M., Fratta L., Maffioli F. A note on finding optimum branchings. Networks. 9:1979;309-312.
9. Camerini P.M., Fratta L., Maffioli F. The K best spanning arborescences of a network. Networks. 10:1980;91-110.
10. Caprara A. Properties of some ILP formulations of a class of partitioning problems. Discrete Applied Mathematics. 87:1998;11-23.
11. A. Caprara, M. Fischetti, Branch-and-cut algorithms, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997, pp. 45-63.
12. A. Caprara, P. Toth, Lower bounds and algorithms for the 2-constraint bin packing problem, Tech. Report, DEIS OR-98-7, University of Bologna, 1998.
13. Carpaneto G., Dell'Amico M., Toth P. Exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software. 21:1995;394-409.
14. Carpaneto G., Dell'Amico M., Toth P. Algorithm 750: CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software. 21:1995;410-415.
15. Carpaneto G., Toth P. Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science. 26:1980;736-743.
16. Carpaneto G., Toth P. Primal-dual algorithms for the assignment problem. Discrete Applied Mathematics. 18:1987;137-153.
17. Dantzig G.B. Discrete variable extremum problems. Operations Research. 5:1957;266-277.
18. M. Dell'Amico, P. Toth, Algorithms and codes for dense assignment problems: The state of the art, Discrete Applied Mathematics, to appear.
19. Derigs U. Solving non-bipartite matching problems via shortest path techniques. Annals of Operations Research. 13:1988;225-261.
20. Edmonds J. Optimum branchings. Journal of Research of the National Bureau of Standards B. 71:1967;233-240.
21. Eilon S., Christofides N. The loading problem. Management Science. 17:1971;259-267.
22. Fayard D., Plateau G. Resolution of the 0-1 knapsack problem: Comparison of methods. Mathematical Programming. 8:1975;272-307.
23. Fayard D., Plateau G. An algorithm for the solution of the 0-1 knapsack problem. Computing. 28:1982;269-287.
24. Fischetti M. Facets of the asymmetric traveling salesman polytope. Mathematics of Operations Research. 16:1991;42-56.
25. M. Fischetti, A. Lodi, P. Toth, A computational comparison of exact algorithms for the asymmetric travelling salesman problem, Tech. Report, DEIS OR-99-10, University of Bologna, 1999.
26. Fischetti M., Toth P. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming. 53:1992;173-197.
27. Fischetti M., Toth P. An efficient algorithm for the min-sum arborescence problem. ORSA Journal of Computing. 5:1993;426-434.
28. Fischetti M., Toth P. A polyhedral approach to the asymmetric traveling salesman problem. Management Science. 43:1997;1520-1536.
29. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research. 9:1961;849-859.
30. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem: Part II. Operations Research. 11:1963;863-888.
31. Grötschel M., Lovász L., Schrijver A. The ellipsoid algorithm and its consequences in combinatorial optimization. Combinatorica. 1:1981;169-197.
32. M. Grötschel, M.W. Padberg, Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985.
33. Hammer P.L., Mahadev N.V.R. Bithreshold graphs. SIAM Journal on Algebraic and Discrete Methods. 6:1985;497-506.
34. Han B.T., Diehr G., Cook J.S. Multiple-type, two-dimensional bin packing problems: Applications and algorithms. Annals of Operations Research. 50:1994;239-261.
35. Horowitz E., Sahni S. Computing partitions with applications to the knapsack problem. Journal of ACM. 21:1974;277-292.
36. Hung M.S., Brown J.R. An algorithm for a class of loading problems. Naval Research Logistics Quarterly. 25:1978;289-297.
37. M. Jünger, G. Reinelt, G. Rinaldi, The traveling salesman problem, in: M. Ball, T.L. Magnanti, C.L. Monma, G. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, vol. 7, Network Models, North-Holland, Amsterdam, 1995, pp. 255-330.
38. Laporte G. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research. 59:1992;231-247.
39. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinchart & Winston, Chichester.
40. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;Wiley, Chichester.
41. Martello S., Toth P. An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research. 1:1977;169-175.
42. Martello S., Toth P. A mixture of dynamic programming and branch-and-bound for the subset-sum problem. Management Science. 30:1984;765-771.
43. Martello S., Toth P. A new algorithm for the 0-1 knapsack problem. Management Science. 34:1988;633-644.
44. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;Wiley, Chichester.
45. Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics. 28:1990;59-70.
46. Martello S., Toth P. Upper bounds and algorithms for hard 0-1 knapsack problems. Operations Research. 45:1997;768-778.
47. S. Martello, P. Toth, Upper bounds and algorithms for the two-constraint knapsack problem, Tech. Report, DEIS OR-99-6, University of Bologna, 1999.
48. Martello S., Pisinger D., Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science. 45:1999;414-424.
49. S. Martello, D. Pisinger, P. Toth, New trends in exact algorithms for the 0-1 knapsack problem, European Journal of Operational Research 123 (2) (2000) 325-332.
50. Nauss R.M. An efficient algorithm for the 0-1 knapsack problem. Management Science. 23:1976;27-31.
51. Padberg M.W., Rinaldi G. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming. 47:1990;19-36.
52. Padberg M.W., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review. 33:1991;60-100.
53. Pekny J.F., Miller D.L. A parallel branch-and-bound algorithm for solving large asymmetric traveling salesman problems. Mathematical Programming. 55:1992;17-33.
54. Pisinger D. An expanding-core algorithm for the exact knapsack problem. European Journal of Operational Research. 87:1995;175-187.
55. Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Operations Research. 45:1997;758-767.
56. Plateau G., Elkihel M. A hybrid algorithm for the 0-1 knapsack problem. Methods of Operations Research. 49:1985;277-293.
57. Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal of Computing. 3:1991;376-384.
58. T.H.C. Smith, V. Srinivasan, G.L. Thompson, Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems, Annals of Discrete Mathematics 1 479-493.
59. Scholl A., Klein R., Jürgens C. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research. 24:1997;627-645.
60. P. Schwerin, G. Wäscher, A new lower bound for the bin-packing problem and its integration into MTP, Tech. Report, Halle University, 1998.
61. Spieksma F.C.R. A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers and Operations Research. 21:1994;19-25.
62. Tarjan R.E. Finding optimum branchings. Networks. 7:1977;25-35.
63. Toth P. Dynamic programming algorithms for the zero-one knapsack problem. Computing. 25:1980;29-45.
64. J.M. Valerio de Carvalho, Exact solution of bin-packing problems using column generation and branch-and-bound, Tech. Report, University of Minho, 1996.
65. P.H. Vance, Branch-and-price algorithms for the one-dimensional cutting stock problem, Tech. Report, Auburn University, 1996.
66. Vance P.H., Barnhart C., Johnson E.L., Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications. 3:1994;111-130.
67. F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock, Mathematical Programming 86 (1999) 565-594.