IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v140y2005i1p67-12410.1007-s10479-005-3968-2.html
   My bibliography  Save this article

Integer-Programming Software Systems

Author

Listed:
  • Alper Atamtürk
  • Martin Savelsbergh

Abstract

Recent developments in integer-programming software systems have tremendously improved our ability to solve large-scale instances. We review the major algorithmic components of state-of-the-art solvers and discuss the options available to users for adjusting the behavior of these solvers when default settings do not achieve the desired performance level. Furthermore, we highlight advances towards integrated modeling and solution environments. We conclude with a discussion of model characteristics and substructures that pose challenges for integer-programming software systems and a perspective on features we may expect to see in these systems in the near future. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    • Handle: RePEc:spr:annopr:v:140:y:2005:i:1:p:67-124:10.1007/s10479-005-3968-2
    DOI: 10.1007/s10479-005-3968-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-3968-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-3968-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zonghao Gu & George L. Nemhauser & Martin W. P. Savelsbergh, 1998. "Lifted Cover Inequalities for 0-1 Integer Programs: Computation," INFORMS Journal on Computing, INFORMS, vol. 10(4), pages 427-437, November.
    2. Quentin Louveaux & Laurence A. Wolsey, 2002. "Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 470-484, August.
    3. MARCHAND, Hugues & WOLSEY, Laurence A., 2001. "Aggregation and mixed integer rounding to solve mips," LIDAM Reprints CORE 1513, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Hanif D. Sherali & J. Cole Smith, 2001. "Improving Discrete Model Representations via Symmetry Considerations," Management Science, INFORMS, vol. 47(10), pages 1396-1407, October.
    5. Zonghao Gu & George L. Nemhauser & Martin W. P. Savelsbergh, 1999. "Lifted Cover Inequalities for 0-1 Integer Programs: Complexity," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 117-123, February.
    6. Hugues Marchand & Laurence A. Wolsey, 2001. "Aggregation and Mixed Integer Rounding to Solve MIPs," Operations Research, INFORMS, vol. 49(3), pages 363-371, June.
    7. NEMHAUSER, George L. & WOLSEY, Laurence A., 1990. "A recursive procedure to generate all cuts for 0-1 mixed integer programs," LIDAM Reprints CORE 894, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. M. W. Padberg & T. J. Van Roy & L. A. Wolsey, 1985. "Valid Linear Inequalities for Fixed Charge Problems," Operations Research, INFORMS, vol. 33(4), pages 842-861, August.
    9. Jacek Gondzio, 1997. "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 9(1), pages 73-91, February.
    10. Padberg, M.W. & Van Roy, T.J. & Wolsey, L.A., 1985. "Valid linear inequalities for fixed charge problems," LIDAM Reprints CORE 656, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. VAN ROY, Tony J. & WOLSEY, Laurence A., 1987. "Solving mixed integer programming problems using automatic reformulation," LIDAM Reprints CORE 782, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. BARANY, Imre & VAN ROY, Tony & WOLSEY, Laurence A., 1984. "Uncapacitated lot-sizing: the convex hull of solutions," LIDAM Reprints CORE 605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Tony J. Van Roy & Laurence A. Wolsey, 1987. "Solving Mixed Integer Programming Problems Using Automatic Reformulation," Operations Research, INFORMS, vol. 35(1), pages 45-57, February.
    14. LOUVEAUX, Quentin & WOLSEY, Laurence, 2002. "Combining problem structure with basis reduction to solve a class of hard integer programs," LIDAM Reprints CORE 1571, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Yihui & Tang, Tao & Ning, Bin & Meng, Lingyun, 2017. "Integrated optimization of regular train schedule and train circulation plan for urban rail transit lines," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 83-104.
    2. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    3. Bruno Domenech & Laia Ferrer‐Martí & Rafael Pastor, 2019. "Comparison of various approaches to design wind‐PV rural electrification projects in remote areas of developing countries," Wiley Interdisciplinary Reviews: Energy and Environment, Wiley Blackwell, vol. 8(3), May.
    4. Ranaboldo, Matteo & Lega, Bruno Domenech & Ferrenbach, David Vilar & Ferrer-Martí, Laia & Moreno, Rafael Pastor & García-Villoria, Alberto, 2014. "Renewable energy projects to electrify rural communities in Cape Verde," Applied Energy, Elsevier, vol. 118(C), pages 280-291.
    5. Schwarz, Hannes & Kotthoff, Lars & Hoos, Holger & Fichtner, Wolf & Bertsch, Valentin, 2017. "Using automated algorithm configuration to improve the optimization of decentralized energy systems modeled as large-scale, two-stage stochastic programs," Working Paper Series in Production and Energy 24, Karlsruhe Institute of Technology (KIT), Institute for Industrial Production (IIP).
    6. Guido Perboli & Roberto Tadei & Daniele Vigo, 2011. "The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics," Transportation Science, INFORMS, vol. 45(3), pages 364-380, August.
    7. Wang, Yihui & D’Ariano, Andrea & Yin, Jiateng & Meng, Lingyun & Tang, Tao & Ning, Bin, 2018. "Passenger demand oriented train scheduling and rolling stock circulation planning for an urban rail transit line," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 193-227.
    8. Farahani, Samira S. & Bleeker, Cliff & van Wijk, Ad & Lukszo, Zofia, 2020. "Hydrogen-based integrated energy and mobility system for a real-life office environment," Applied Energy, Elsevier, vol. 264(C).
    9. Kumar Abhishek & Sven Leyffer & Jeff Linderoth, 2010. "FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 555-567, November.
    10. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    11. David R. Morrison & Jason J. Sauppe & Wenda Zhang & Sheldon H. Jacobson & Edward C. Sewell, 2017. "Cyclic best first search: Using contours to guide branch‐and‐bound algorithms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 64-82, February.
    12. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    13. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    14. Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.
    15. Syam Menon & Sumit Sarkar, 2007. "Minimizing Information Loss and Preserving Privacy," Management Science, INFORMS, vol. 53(1), pages 101-116, January.
    16. B. Domenech & L. Ferrer-Martí & R. Pastor, 2022. "Multicriteria analysis of renewable-based electrification projects in developing countries," Annals of Operations Research, Springer, vol. 312(2), pages 1375-1401, May.
    17. Esmaeilbeigi, Rasul & Charkhgard, Parisa & Charkhgard, Hadi, 2016. "Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations," European Journal of Operational Research, Elsevier, vol. 251(2), pages 419-431.
    18. Ferrer-Martí, L. & Domenech, B. & García-Villoria, A. & Pastor, R., 2013. "A MILP model to design hybrid wind–photovoltaic isolated rural electrification projects in developing countries," European Journal of Operational Research, Elsevier, vol. 226(2), pages 293-300.
    19. Roger Rocha & Ignacio Grossmann & Marcus Poggi de Aragão, 2013. "Cascading Knapsack Inequalities: reformulation of a crude oil distribution problem," Annals of Operations Research, Springer, vol. 203(1), pages 217-234, March.
    20. Irfan Ertugrul & Aysegul Tus Isik, 2009. "Production Planning for a Winery With Mixed Integer Programming Model," Ege Academic Review, Ege University Faculty of Economics and Administrative Sciences, vol. 9(2), pages 375-387.
    21. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
    22. Marius Posta & Jacques Ferland & Philippe Michelon, 2012. "An exact method with variable fixing for solving the generalized assignment problem," Computational Optimization and Applications, Springer, vol. 52(3), pages 629-644, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    2. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    3. Robert Bixby & Edward Rothberg, 2007. "Progress in computational mixed integer programming—A look back from the other side of the tipping point," Annals of Operations Research, Springer, vol. 149(1), pages 37-41, February.
    4. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    5. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
    6. Alper Atamtürk, 2005. "Cover and Pack Inequalities for (Mixed) Integer Programming," Annals of Operations Research, Springer, vol. 139(1), pages 21-38, October.
    7. Agostinho Agra & Marielle Christiansen & Alexandrino Delgado, 2013. "Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem," Transportation Science, INFORMS, vol. 47(1), pages 108-124, February.
    8. Quentin Louveaux & Laurence Wolsey, 2007. "Lifting, superadditivity, mixed integer rounding and single node flow sets revisited," Annals of Operations Research, Springer, vol. 153(1), pages 47-77, September.
    9. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.
    10. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    11. Hultberg, Tim H. & Cardoso, Domingos M., 1997. "The teacher assignment problem: A special case of the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 101(3), pages 463-473, September.
    12. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
    13. Diego Klabjan & George L. Nemhauser, 2002. "A Polyhedral Study of Integer Variable Upper Bounds," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 711-739, November.
    14. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    15. Andreas Eisenblätter & Hans-Florian Geerdes & Thorsten Koch & Alexander Martin & Roland Wessäly, 2006. "UMTS radio network evaluation and optimization beyond snapshots," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 1-29, February.
    16. Brian T. Denton & Andrew J. Miller & Hari J. Balasubramanian & Todd R. Huschka, 2010. "Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty," Operations Research, INFORMS, vol. 58(4-part-1), pages 802-816, August.
    17. Syed Ali, Sharifah Aishah & Doostmohammadi, Mahdi & Akartunalı, Kerem & van der Meer, Robert, 2018. "A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups," International Journal of Production Economics, Elsevier, vol. 203(C), pages 276-285.
    18. Dimitri J. Papageorgiou & Alejandro Toriello & George L. Nemhauser & Martin W. P. Savelsbergh, 2012. "Fixed-Charge Transportation with Product Blending," Transportation Science, INFORMS, vol. 46(2), pages 281-295, May.
    19. Alberto Del Pia & Robert Weismantel, 2016. "Relaxations of mixed integer sets from lattice-free polyhedra," Annals of Operations Research, Springer, vol. 240(1), pages 95-117, May.
    20. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:140:y:2005:i:1:p:67-124:10.1007/s10479-005-3968-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.