General mixed integer programming: Computational issues for branch-and-cut algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2241, Issue , 2001, Pages 1-25

  Martin, Alexander ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; MOBILE AGENTS; OPTIMIZATION;

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL ISSUES; CUTTING PLANES; MIXED INTEGER PROGRAMMING; PREPROCESSING TECHNIQUES; STATE OF THE ART;

INTEGER PROGRAMMING;

EID: 84959058970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45586-8_1     Document Type: Conference Paper

References (72)

1. K. Aardal, R. Weismantel, and L.A. Wolsey. Non-standard approaches to integer programming. Technical Report CORE DP2000/2, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 2000.
2. E. D. Andersen and K. D. Andersen. Presolving in linear programming. Mathematical Programming, 71:221–245, 1995.
3. D. Applegate, R. E. Bixby, V. Chvátal, and W. Cook. Finding cuts in the TSP. Technical Report 95-05, DIMACS, March 1995.
4. E. Balas. Facets of the knapsack polytope. Mathematical Programming, 8:146–164, 1975.
5. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0 − 1 programs. Mathematical Programming, 58:295–324, 1993.
6. E. Balas, S. Ceria, and G. Cornuéjols. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science, 42:1229–1246, 1996.
7. E. Balas, S. Ceria, G. Cornuéjols, and N. Natraj. Gomory cuts revisited. Operations Research Letters, 19:1–9, 1996.
8. M. Benichou, J. M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent. Experiments in mixed-integer programming. Mathematical Programming, 1:76–94, 1971.
9. R. E. Bixby. Lectures on Linear Programming. Rice University, Houston, Texas, Spring 1994.
10. R. E. Bixby, S. Ceria, C. McZeal, and M. W. P. Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0. Information on the paper and the problems are available at WWW Page: http://www.caam.rice.edu/∼bixby/miplib/miplib.html, 1998.
11. R.E. Bixby, M. Fenelon, Z. Guand E. Rothberg, and R. Wunderling. MIP: Theory and practice closing the gap. Technical report, ILOG Inc., Paris, France, 1999.
12. R. Borndörfer. Aspects of Set Packing, Partitioning, and Covering. PhD thesis, Technische Universität Berlin, 1998.
13. R. Borndörfer, C. E. Ferreira, and A. Martin. Decomposing matrices into blocks. SIAM Journal on Optimization, 9:236–269, 1998.
14. A. Caprara and M. Fischetti. Branch-and-cut algorithms. In M. Dell’Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 45–63. John Wiley & Sons Ltd, Chichester, 1997.
15. S. Ceria, C. Cordier, H. Marchand, and L. A. Wolsey. Cutting planes for integer programs with general integer variables. Mathematical Programming, 81:201–214, 1998.
16. V. Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305–337, 1973.
17. V. Chvátal. Linear Programming. W. H. Freeman and Company, 1983.
18. J.M. Clochard and D. Naddef. Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem. In Lawrence Wolsey and Giovanni Rinaldi, editors, Proceedings on the Third IPCO Conference, pages 291–311, 1993.
19. C. Cordier, H. Marchand, R. Laundy, and L. A. Wolsey. bc–opt: a branch-and-cut code for mixed integer programs. Mathematical Programming, 86:335–354, 1999.
20. H. Crowder, E. Johnson, and M. W. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31:803–834, 1983.
21. DASH Associates, Blisworth House, Blisworth, Northants NN7 3BX, United Kingdom. XPRESS-MP Optimisation Subroutine Library, 2001. Information available at URL http://www.dash.co.uk.
22. J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization, 4:794–814, 1994.
23. C. E. Ferreira. On Combinatorial Optimization Problems Arising in Computer System Design. PhD thesis, Technische Universität Berlin, 1994.
24. C. E. Ferreira, A. Martin, and R. Weismantel. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization, 6:858–877, 1996.
25. R. E. Gomory. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society, 64:275–278, 1958.
26. R. E. Gomory. An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation, 1960.
27. R. E. Gomory. Solving linear programming problems in integers. In R. Bellman and M. Hall, editors, Combinatorial analysis, Proceedings of Symposia in Applied Mathematics, volume 10, Providence RI, 1960.
28. R. E. Gomory. An algorithm for integer solutions to linear programming. In R. L. Graves and P. Wolfe, editors, Recent Advances in Mathematical Programming, pages 269–302, New York, 1969. McGraw-Hill.
29. J. Gondzio. Presolve analysis of linear programs prior to apply an interior point method. INFORMS Journal on Computing, 9:73–91, 1997.
30. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.
31. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
32. Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Cover inequalities for 0 − 1 linear programs: complexity. INFORMS Journal on Computing, 11:117–123, 1998.
33. Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Cover inequalities for 0 − 1 linear programs: computation. INFORMS Journal on Computing, 10:427–437, 1998.
34. Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming, 85:439–468, 1999.
35. Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Sequence independent lifting in mixed integer programming. Journal on Combinatorial optimization, 4:109–129, 2000.
36. P. L. Hammer, E.L. Johnson, and U. N. Peled. Facets of regular 0-1 polytopes. Mathematical Programming, 8:179–206, 1975.
37. K. L. Hoffman and M. W. Padberg. Improved LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing, 3:121–134, 1991.
38. ILOG CPLEX Division, 889Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callable Library, 1997. Information available at URL http://www.cplex.com.
39. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callable Library, 2000. Information available at URL http://www.cplex.com.
40. Jünger, M., Thienel, S.: The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization. Software Practice and Experience 30, 1325–1352, 2000.
41. E. Johnson and M. W. Padberg. A note on the knapsack problem with special ordered sets. Operations Research Letters, 1:18–22, 1981.
42. D. Klabjan, G. L. Nemhauser, and C. Tovey. The complexity of cover inequality separation. Operations Research Letters, 23:35–40, 1998.
43. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207–232, 1998.
44. A. Land and S. Powell. Computer codes for problems of integer programming. Annals of Discrete Mathematics, 5:221–269, 1979.
45. J. T. Linderoth and M. W. P. Savelsbergh. A computational study of search strategies for mixed integer programming. Technical Report LEC-97-12, Georgia Institute of Technology, 1997.
46. H. Marchand. A Polyhedral Study of the Mixed Knapsack Set and its Use to Solve Mixed Integer Programs. PhD thesis, Université Catholique de Louvain, Louvainla-Neuve, Belgium, 1998.
47. H. Marchand, A. Martin, R. Weismantel, and L.A. Wolsey. Cutting planes in integer and mixed integer programming. Technical Report CORE DP9953, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1999.
48. H. Marchand and L. A. Wolsey. The 0−1 knapsack problem with a single continuous variable. Mathematical Programming, 85:15–33, 1999.
49. A. Martin. Integer programs with block structure. Habilitations-Schrift, Technische Universität Berlin, 1998.
50. A. Martin and R. Weismantel. The intersection of knapsack polyhedra and extensions. In R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, Proceedings of the 6th IPCO Conference, pages 243–256, 1998.
51. G. Mitra. Investigations of some branch and bound strategies for the solution of mixed integer linear programs. Mathematical Programming, 4:155–170, 1973.
52. D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric tsp. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations. Kluwert, 2001. To appear.
53. G. L. Nemhauser, M. W. P. Savelsbergh, and G. C. Sigismondi. MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15:47–58, 1994.
54. G. L. Nemhauser and P. H. Vance. Lifted cover facets of the 0 − 1 knapsack polytope with GUB constraints. Operations Research Letters, 16:255–263, 1994.
55. G. L. Nemhauser and L. A. Wolsey. A recursive procedure to generate all cuts for 0 − 1 mixed integer programs. Mathematical Programming, 46:379–390, 1990.
56. M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199–215, 1973.
57. M. W. Padberg. A note on zero-one programming. Operations Research, 23:833–837, 1975.
58. M. W. Padberg. (1, k)-configurations and facets for packing problems. Mathematical Programming, 18:94–99, 1980.
59. M. W. Padberg. Linear Optimization and Extensions. Springer, 1995.
60. M. W. Padberg. Classical cuts for mixed-integer programming and branch-and-cut. Technical report, New York University, 2000. To appear in MMOR.
61. M. W. Padberg, T. J. Van Roy, and L. A. Wolsey. Valid inequalities for fixed charge problems. Operations Research, 33:842–861, 1985.
62. T. J. Van Roy and L. A. Wolsey. Solving mixed integer programming problems using automatic reformulation. Operations Research, 35:45–57, 1987.
63. A. Schrijver. On cutting planes. Annals of Discrete Mathematics, 9:291–296, 1980.
64. Ramesh Sharda. Linear programming solver software for personal computers: 1995 report. OR/MS Today, 22(5):49–57, 1995.
65. Uwe H. Suhl and R. Szymanski. Supernode processing of mixed-integer models. Computational Optimization and Applications, 3:317–331, 1994.
66. Stefan Thienel. ABACUS A Branch-And-CUt System. PhD thesis, Universität zu Köln, 1995.
67. J. A. Tomlin and J. S. Welsh. Finding duplicate rows in a linear program. Operations Research Letters, 5:7–11, 1986.
68. R. Weismantel. On the 0/1 knapsack polytope. Mathematical Programming, 77:49–68, 1997.
69. L. A. Wolsey. Faces of linear inequalities in 0-1 variables. Mathematical Programming, 8:165–178, 1975.
70. L. A. Wolsey. Valid inequalities and superadditivity for 0/1 integer programs. Mathematics of Operations Research, 2:66–77, 1977.
71. L. A. Wolsey. Valid inequalities for 0-1 knapsacks and MIPs with generalized upper bound constraints. Discrete Applied Mathematics, 29:251–261, 1990.
72. E. Zemel. Easily computable facets of the knapsack polytope. Mathematics of Operations Research, 14:760–764, 1989.