Noncommercial software for mixed-integer linear programming

Integer Programming: Theory and Practice

Volumn , Issue , 2005, Pages 253-304

  Linderoth, Jeffrey T ^a   Ralphs, Ted K ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84903602606     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (87)

1. Achterberg, T., SCIP — a framework to integrate constraint and mixed integer programming, Technical Report ZIB-Report 04-19, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, Berlin, 2005.
2. Achterberg, T., Koch, T., and Martin, A., Branching rules revisited, Operations Research Letters, 33, 42, 2004.
3. Applegate, D., Bixby, R., Cook, W., and Chvátal, V., 1996, Personal communication.
4. Atamtürk, A., Nemhauser, G., and Savelsbergh, M.W. P., Conflict graphs in integer programming, Technical Report LEC-98-03, Georgia Institute of Technology, 1998.
5. Atamtürk, A., Nemhauser, G., and Savelsbergh, M. W. P., Conflict graphs in solving integer programming problems, European J. Operational Research, 121, 40, 2000.
6. Atamtürk, A. and Savelsbergh, M., Integer-programming software systems, Annals of Operations Research, 2005, To appear, Available from http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/publications/ipsoftware-final.pdf.
7. Balas, E., Facets of the knapsack polytope, Mathematical Programming, 8, 146, 1975.
8. Balas, E., Ceria, S., Cornuejols, G., and Natraj, N., Gomory cuts revisited, Operations Research Letters, 19, 1, 1999.
9. Balas, E. and Martin, R., Pivot and complement: a heuristic for 0-1 programming, Management Science, 26, 86, 1980.
10. Balas, E. and Saltzman, M., An algorithm for the three-index assignment problem, Operations Research, 39, 150, 1991.
11. Balas, E., Schmieta, S., and Wallace, C., Pivot and shift — A mixed integer programming heuristic, Discrete Optimization, 1, 3, 2004.
12. Beale, E. M. L., Branch and bound methods for mathematical programming systems, in Discrete Optimization II, edited by Hammer, P. L., Johnson, E. L., and Korte, B. H., pages 201–219, North Holland Publishing Co., 1979.
13. Beale, E. W. L. and Tomlin, J. A., Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables, in Proceedings of the 5th International Conference on Operations Research, edited by Lawrence, J., pages 447–454, 1969.
14. Bénichou, M. et al., Experiments in mixed-integer linear programming, Mathematical Programming, 1, 76, 1971.
15. Berkelaar, M., lp_solve 5.1, 2004, Available from http://groups.yahoo.com/group/lp_solve/.
16. Bixby, R. E., Ceria, S., McZeal, C. M., and Savelsbergh, M. W. P., An updated mixed integer programming library: MIPLIB 3.0, Optima, 58, 12, 1998.
17. Borndörfer, R. and Weismantel, R., Set packing relaxations of some integer programs, Mathematical Programming, 88, 425, 2000.
18. Chvátal, V., Linear Programming, W. H. Freeman and Co., New York, 1983.
19. COIN-OR: Computational Infrastructure for Operations Research, 2004, http://www.coin-or.org.
20. Colombani, Y. and Heipcke, S., Mosel: An extensible environment for modeling and programming solutions, in Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’02), edited by Jussien, N. and Laburthe, F., pages 277–290, 2002.
21. Czyzyk, J., Mesnier, M., and Moré, J., The NEOS server, IEEE Journal on Computational Science and Engineering, 5, 68, 1998.
22. Danna, E., Rothberg, E., and LePape, C., Exploring relaxation induced neighborhoods to improve MIP solutions, Mathematical Programming, 2004, To appear.
23. Dolan, E., Fourer, R., Moré, J., and Munson, T., Optimization on theNEOSserver, SIAM News, 35, 8, 2002.
24. Dolan, E., Moré, J., and Munson, T., Optimality measures for performance profiles, Preprint ANL/MCS-P1155-0504, Mathematics and Computer Science Division, Argonne National Lab, 2004.
25. Dolan, E. and Moré, J., Benchmarking optimization software with performance profiles, Mathematical Programming, 91, 201, 2002.
26. Driebeek, N. J., An algorithm for the solution of mixed integer programming problems, Management Science, 12, 576, 1966.
27. Eckstein, J., Parallel branch-and-bound methods for mixed integer programming, SIAM News, 27, 12, 1994.
28. Edmonds, J., Maximum matching and a polyhedron with 0-1 vertices, Journal of Research of the National Bureau of Standards, 69B, 125, 1965.
29. Fischetti, M. and Lodi, A., Local branching, Mathematical Programming, 98, 23, 2002.
30. Forrest, J., CBC, 2004, Available from http://www.coin-or.org/.
31. Forrest, J. J. H., Hirst, J. P. H., and Tomlin, J. A., Practical solution of large scale mixed integer programming problems with UMPIRE, Management Science, 20, 736, 1974.
32. Fourer, R., Lopes, L., and Martin, K., LPFML: A W3C XML schema for linear programming, 2004, Available from http://www.optimization-online.org/DB_HTML/2004/02/817.html.
33. Fourer, R., Gay, D. M., and Kernighan, B. W., AMPL: A Modeling Language for Mathematical Programming, The Scientific Press, 1993.
34. Galati, M., COIN-OR tutorials, 2004, Available from http://coral.ie. lehigh.edu/∼coin/.
35. Gauthier, J. M. and Ribière, G., Experiments in mixed-integer linear programming using pseudocosts, Mathematical Programming, 12, 26, 1977.
36. Gomory, R. E., An algorithm for the mixed integer problem, Technical Report RM-2597, The RAND Corporation, 1960.
37. Grötschel, M., Lovász, L., and Schrijver, A., Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988.
38. Gu, Z., Nemhauser, G. L., and Savelsbergh, M. W. P., Cover inequalities for 0-1 linear programs: Computation, INFORMS Journal on Computing, 10, 427, 1998.
39. Gu, Z., Nemhauser, G. L., and Savelsbergh, M. W. P., Lifted flow covers for mixed 0-1 integer programs, Mathematical Programming, 85, 439, 1999.
40. Gu, Z., Nemhauser, G. L., and Savelsbergh, M. W. P., Sequence independent lifting, Journal of Combinatorial Optimization, 4, 109, 2000.
41. Hafer, L., bonsaiG 2.8, 2004, Available from http://www.cs.sfu.ca/∼lou/BonsaiG/dwnldreq.html.
42. Hammer, P. L., Johnson, E. L., and Peled, U. N., Facets of regular 0-1 polytopes, Mathematical Programming, 8, 179, 1975.
43. Hoffman, K. and Padberg, M., Solving airline crew-scheduling problems by branch-and-cut, Management Science, 39, 667, 1993.
44. Hultberg, T., FlopC++, 2004, Available from http://www.mat.ua.pt/thh/flopc/.
45. ILOG concert technology, http://www.ilog.com/products/optimization/tech/concert.cfm.
46. Jünger, M. and Thienel, S., The ABACUS system for branch and cut and price algorithms in integer programming and combinatorial optimization, Software Practice and Experience, 30, 1325, 2001.
47. Ladányi, L., Parallel Branch and Cut and Its Application to the Traveling Salesman Problem, PhD thesis, Cornell University, 1996.
48. Ladányi, L., BCP, 2004, Available from http://www.coin-or.org/.
49. Linderoth, J. T. and Savelsbergh, M. W. P., A computational study of search strategies in mixed integer programming, INFORMS Journal on Computing, 11, 173, 1999.
50. Linderoth, J., MIPinstances, 2004, Available from http://coral.ie.lehigh.edu/mip-instances.
51. Lougee-Heimer, R., The Common Optimization INterface for Operations Research, IBM Journal of Research and Development, 47, 57, 2003.
52. Lougee-Heimer, R., Saltzman, M., and Ralphs, T., ‘COIN’ of the OR Realm, OR/MS Today, October, 2004.
53. Makhorin, A., GLPK4.2, 2004, Available from http://www.gnu.org/software/glpk/glpk.html.
54. Marchand, H., A Study of the Mixed Knapsack Set and Its Use to Solve Mixed Integer Programs, PhD thesis, Facult’e des Sciences Appliquées, Université Catholique de Louvain, 1998.
55. Marchand, H. and Wolsey, L., Aggregation and mixed integer rounding to solve MIPs, Operations Research, 49, 363, 2001.
56. Margot, F., BAC: A BCP based branch-and-cut example, Report RC22799, IBM Research, 2004.
57. Martin, A., Achterberg, T., and Koch, T., MIPLIB 2003, Avaiable from http://miplib.zib.de.
58. Mitra, G., Investigation of some branch and bound strategies for the solution of mixed integer linear programs, Mathematical Programming, 4, 155, 1973.
59. Nediak, M. and Eckstein, J., Pivot, cut, and dive: A heuristic for mixed 0-1 integer programming, Technical Report RUTCOR Research Report RRR53-2001, Rutgers University, 2001.
60. Nemhauser, G. and Savelsbergh, M., MINTO3.1, 2004, Available from http://coral.ie.lehigh.edu/minto/.
61. Nemhauser, G. and Wolsey, L., A recursive procedure for generating all cuts for 0-1 mixed integer programs, Mathematical Programming, 46, 379, 1990.
62. Nemhauser, G. and Wolsey, L. A., Integer and Combinatorial Optimization, John Wiley and Sons, New York, 1988.
63. Nemhauser, G. L. and Sigismondi, G., A strong cutting plane/branch-andbound algorithm for node packing, Journal of the Operational Research Society, 43, 443, 1992.
64. Nemhauser, G. L. and Trotter, L. E. Jr., Properties of vertex packing and independence system polyhedra, Mathematical Programming, 6, 48, 1974.
65. Padberg, M., On the facial structure of set packing polyhedra, Mathematical Programming, 5, 199, 1973.
66. Padberg, M., Linear Optimization and Extensions, Springer-Verlag, New York, 1995.
67. Ralphs, T. K., Ladányi, L., and Saltzman, M. J., Parallel branch, cut, and price for large-scale discrete optimization, Mathematical Programming, 98, 253, 2003.
68. Ralphs, T., Parallel Branch and Cut for Vehicle Routing, PhD thesis, Cornell University, 1995.
69. Ralphs, T., SYMPHONY 5.0, 2004, Available from http://www.branchandcut.org/SYMPHONY/.
70. Ralphs, T., SYMPHONY Version 5.0 User’s Manual, Technical Report 04T-020, Lehigh University Industrial and Systems Engineering, 2004, Available from http://www.lehigh.edu/∼tkr2/research/pubs.html.
71. Ralphs, T. and Guzelsoy, M., The SYMPHONY callable library for mixed integer programming, in The Proceedings of the Ninth Conference of the INFORMS Computing Society, 2005, To appear, Available from http://www.lehigh.edu/∼tkr2/research/pubs.html.
72. Ralphs, T., Saltzman, M., and Wiecek, M., An improved algorithm for biobjective integer programming, Annals of Operations Research, 2005, To appear, Available from http://www.lehigh.edu/∼tkr2/research/pubs.html.
73. Roy, J.-S., PuLP: A linear programming modeler in Python, Available from http://www.jeannot.org/∼js/code/index.en.html#PuLP.
74. Savelsbergh, M.W. P., Preprocessing and probing techniques for mixed integer programming problems, ORSA Journal on Computing, 6, 445, 1994.
75. Schrage, L. and Wolsey, L. A., Sensitivity analysis for branch and bound linear programming, Operations Research, 33, 1008, 1985.
76. Schrijver, A., Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
77. Sidebottom, G., Satisfaction of constraints on nonnegative integer arithmetic expressions, Open File Report 1990-15, Alberta Research Council, 6815 8th Street, Calgary, Alberta, CA T2E 7H7, 1990.
78. Thienel, S., ABACUS 2.3, 2004, Available from http://www.informatik.uni-koeln.de/abacus/.
79. Tomlin, J. A., An improved branch-and-bound method for integer programming, Operations Research, 19, 1070, 1971.
80. Trick, M. and Guzelsoy, M., Simple walkthrough of building a solver with symphony, 2004, Available from ftp://branchandcut.org/pub/reference/SYMPHONY-Walkthrough.pdf.
81. van Heesch, D., Doxygen documentation system, 2004, Available from http://www.doxygen.org/.
82. Vanderbeck, F., A generic view of Dantzig-Wolfe decomposition in mixed integer programming, Working paper, 2003, Available from http://www.math.u-bordeaux.fr/∼fv/papers/dwcPap.pdf.
83. Wolsey, L. A., Faces for a linear inequality in 0-1 variables, Mathematical Programming, 8, 165, 1975.
84. Wolsey, L. A., Valid inequalities for mixed integer programs with generalized and variable upper bound constraints, Discrete Applied Mathematics, 25, 251, 1990.
85. Wolsey, L. A., Integer Programming, John Wiley and Sons, New York, 1998.
86. Xu, Y., Ralphs, T., Ladányi, L., and Saltzman, M., ALPS: A framework for implementing parallel search algorithms, in The Proceedings of the Ninth Conference of the INFORMS Computing Society, 2005, To appear, Available from http://www.lehigh.edu/∼tkr2/research/pubs.html.
87. ZIMPL, Available from http://www.zib.de/koch/zimpl/.