Skip to main content
SpringerLink
Log in

Types of Mixed Integer Linear Programming Problems

  • Chapter
  • First Online:
Business Optimization Using Mathematical Programming

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 307))

  • 1165 Accesses

Abstract

In this chapter a number of standard ILP problems will be formulated. As in Chap. 4, we shall look at some straightforward problems that are easy to formulate and then consider harder ILP problems. For many of the problem types a case study is provided, and for some of these, a model relating to the case is supplied in MCOL.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The data e4deliver.dat and the Mosel implementation are from e4deliver.mos in FICO Xpress Optimization Examples Repository (https://examples.xpress.fico.com/example.pl?id=mosel_app_5_4).

References

  1. Anbil, R., Gelman, E., Patty, B., Tanga, R.: Recent advances in crew pairing optimization at American airlines. Interfaces 21(1), 62–74 (1991)

    Article  Google Scholar 

  2. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ (2007)

    Google Scholar 

  3. Arabeyre, J., Fearnley, J., Steiger, F., Teather, W.: The airline crew scheduling problem: a survey. Transport. Sci. 3, 140–163 (1969)

    Article  Google Scholar 

  4. Baker, B., Baia, A.P.: Branch-and-bound algorithms for a regional water authority distribution problem. J. Oper. Res. Soc. 46, 698–707 (1995)

    Article  Google Scholar 

  5. Baker, E., Fisher, M.: Computational results for very large air crew scheduling problems. OMEGA 9, 613–618 (1981)

    Article  Google Scholar 

  6. Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Ann. OR 175(1), 213–245 (2010)

    Article  Google Scholar 

  7. Blais, J.Y., Lamont, J., Rousseau, J.M.: The HASTUS vehicle and manpower scheduling system at Societeè de Transport de la Communantè Urbaine de Montrèal. Interfaces 20(1), 26–42 (1990)

    Article  Google Scholar 

  8. Blazewicz, J., Ecker, K., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems. Springer, Berlin, Heidelberg (1993)

    Book  Google Scholar 

  9. Bohoris, G.A., Thomas, J.M.: A heuristic for vehicle routing and depot staffing. J. Oper. Res. Soc. 46, 1184–1191 (1995)

    Article  Google Scholar 

  10. Cacchiani, V., Bolton, C.C., Toth, P.: Models and algorithms for the traveling salesman problem with time-dependent service times. Eur. J. Oper. Res. 283(3), 825–843 (2020)

    Article  Google Scholar 

  11. Christofides, N., Beasley, J.E.: A tree search algorithm for the p-Median problem. Eur. J. Oper. Res. 10, 196–204 (1982)

    Article  Google Scholar 

  12. Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize floats: an analytic study of exact and approximate algorithms. Manage. Sci. 23, 789–810 (1977)

    Article  Google Scholar 

  13. Dantzig, G.B.: Discrete variable extremum problems. Oper. Res. 5, 266–277 (1957)

    Article  Google Scholar 

  14. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling salesman problem. Oper. Res. 2, 393–410 (1954)

    Google Scholar 

  15. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 225–242. Society for Industrial and Applied Mathematics, Philadelphia, PA (2001)

    Google Scholar 

  16. Dyson, R.G., Gregory, A.S.: The cutting stock problem in the glass industry. Oper. Res. Quart. 25, 41–54 (1974)

    Article  Google Scholar 

  17. Edmonds, J., Johnson, E.L.: Matching and Euler tours and the Chinese postman problem. Math. Program. 5, 88–124 (1973)

    Article  Google Scholar 

  18. Eglese, R.W.: Routing winter gritting vehicles. Discr. Appl. Math. 48, 231–244 (1994)

    Article  Google Scholar 

  19. Gershkoff, I.: Optimizing flight crew schedules. Interfaces 19(4), 29–43 (1989)

    Article  Google Scholar 

  20. Guéret, C., Heipcke, S., Prins, C., Sevaux, M.: Applications of Optimization with Xpress-MP. Dash Optimization, Blisworth (2002)

    Google Scholar 

  21. Irnich, S., Toth, P., Vigo, D.: The family of vehicle routing problems. In: Toth, P., Vigo, D. (eds.) Vehicle Routing. MOS-SIAM Series on Optimization, vol. 18, pp. 1–33. SIAM, New York (2014)

    Google Scholar 

  22. Laporte, G., Nickel, S., Saldanha da Gama, F.: Location Science. Springer, Cham (2015)

    Google Scholar 

  23. Laporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions. EURO J. Transport. Logist. 2(1-2), 1–4 (2013)

    Article  Google Scholar 

  24. Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)

    Google Scholar 

  25. Lenstra, J.K., Kan, A.H.G.R., Brucker, P.: Complexity of machine scheduling problems. Ann. Discr. Math. 1, 343–362 (1977)

    Article  Google Scholar 

  26. Leung, J., Magnanti, T.L.: Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44, 271–291 (1989)

    Article  Google Scholar 

  27. Little, J.D.C., Murty, K.G., Sweeney, D.W., Karel, C.: An algorithm for the traveling salesman problem. Oper. Res. 11, 972–989 (1963)

    Article  Google Scholar 

  28. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)

    Google Scholar 

  29. Mei-Ko, K.: Graphic programming using odd or even points. Chin. Math. 1, 273–277 (1962)

    Google Scholar 

  30. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. ACM 7, 326–329 (1960)

    Google Scholar 

  31. Mingozzi, A., Roberti, R., Toth, P.: An exact algorithm for the multitrip vehicle routing problem. INFORMS J. Comput. 25(2), 193–207 (2013)

    Article  Google Scholar 

  32. Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18, 339–348 (1984)

    Article  Google Scholar 

  33. Osman, I.H., Christofides, N.: Capacitated clustering problems by hybrid simulated annealing and tabu search. Int. Trans. Oper. Res. 1, 317–336 (1994)

    Article  Google Scholar 

  34. Padberg, M.W., Rinaldi, G.: Optimization of a 532-city traveling salesman problem by branch and cut. Oper. Res. Lett. 6, 1–6 (1987)

    Article  Google Scholar 

  35. Potts, C.N., Wassenhove, L.N.V.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43, 395–406 (1992)

    Article  Google Scholar 

  36. Robinson, E.P., Gao, L.L., Muggenborg, S.D.: Designing an integrated distribution system at DowBrands Inc. Interfaces 23(3), 107–117 (1993)

    Article  Google Scholar 

  37. Ryan, D.M.: The solution of massive generalized set partitioning problems in aircrew rostering. J. Oper. Res. Soc. 43, 459–468 (1992)

    Article  Google Scholar 

  38. Salkin, H.M., Kluyver, C.A.D.: The knapsack problem: a survey. Naval Res. Logist. Quart. 24, 127–144 (1975)

    Article  Google Scholar 

  39. Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6, 18–25 (1955)

    Google Scholar 

  40. Spencer(III), T., Brigandi, A.J., Dargon, D.R., Sheehan, M.J.: AT&Ts telemarketing site selection system offers customer support. Interfaces 20(1), 83–96 (1990)

    Google Scholar 

  41. Subramanian, R., Scheff(Jr.), R.P., Quinlan, J.D., Wiper, D.S., Marsten, R.E.: Coldstart: fleet assignment at delta air lines. Interfaces 24(1), 104–120 (1994)

    Google Scholar 

  42. Toregas, C., Swain, R., Revelle, C., Bergman, L.: The location of emergency service vehicles. Oper. Res. 19, 1363–1373 (1971)

    Article  Google Scholar 

  43. Toth, P., Vigo, D.: 2. Branch-and-bound algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 29–51. SIAM, Philadelphia, PA (2002)

    Chapter  Google Scholar 

  44. Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discr. Appl. Math. 123(1–3), 487–512 (2002)

    Article  Google Scholar 

  45. Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia, PA (2002)

    Book  Google Scholar 

  46. Toth, P., Vigo, D. (eds.): Vehicle Routing. MOS-SIAM Series on Optimization, vol. 18. SIAM, Philadelphia (2014)

    Google Scholar 

  47. Vasquez-Marques, A.: American airlines arrival slot allocation system (ASAS). Interfaces 21(1), 42–61 (1991)

    Article  Google Scholar 

  48. Wenger, K.M.: Generic Cut Generation Methods for Routing Problems. Ph.D. thesis, University of Heidelberg, Institute of Computer Science, Im Neuenheimer Feld 368, D-69120 Heidelberg (2003). ISBN 3-8322-2545-5, Shaker Verlag, http://www.shaker.de

  49. Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. J. Oper. Res. Soc. 40, 395–399 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Astronomy, University of Florida, Gainesville, FL, USA

    Josef Kallrath

Authors
  1. Josef Kallrath
    View author publications

    You can also search for this author in PubMed Google Scholar

7.1 Electronic Supplementary Material

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kallrath, J. (2021). Types of Mixed Integer Linear Programming Problems. In: Business Optimization Using Mathematical Programming. International Series in Operations Research & Management Science, vol 307. Springer, Cham. https://doi.org/10.1007/978-3-030-73237-0_7

Download citation

Publish with us

Policies and ethics

Search

Navigation