Skip to main content
SpringerLink
Log in

Modeling Difficult Optimization Problems

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Introduction

  Models and the Art of Modeling

Tricks of the Trade for Monolithic Models

Decomposition Techniques

  Column Generation

  Column Enumeration

  Branch-and-Price

  Rolling Time Decomposition

An Exhaustion Method

  Indices and Sets

  Variables

  The Idea of the Exhaustion Method

  Computing Lower Bounds

Primal Feasible Solutions and Hybrid Methods

Summary

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Anstreicher KM (2001) Linear Programming: Interior Point Methods. In: Floudas CA, Pardalos P (eds) Encyclopedia of Optimization, vol 3. Kluwer, Dordrecht, pp 189–191

    Google Scholar 

  2. Barnhart C, Johnson EL, Nemhauser GL, Savelsberg MWP, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316–329

    Article  MathSciNet  MATH  Google Scholar 

  3. Belov G, Scheithauer G (2006) A Branch-and-Crice Algorithm for One-Dimensional Stock Cutting and Two-Dimensional Two-Stage Cutting. Eur J Oper Res 171:85–106

    Article  MathSciNet  MATH  Google Scholar 

  4. Borisovsky P, Dolgui A, Eremeev A (2006) Genetic Algorithms for Supply Management Problem with Lower-bounded Demands. In: Dolgui A, Morel G, Pereira C (eds) Information Control Problems in Manufacturing 2006: A Proceedings volume from the 12th IFAC International Symposium. vol. 3., St Etienne, France, 17-19 May 2006. North-Holland, Dordrecht, pp 521–526

    Google Scholar 

  5. Bredström D, Lundgren JT, R̈nnqvist M, Carlsson D, Mason A (2004) Supply Chain Optimization in the Pulp Mill Industry – IP models, Column Generation and Novel Constraint Branches. Eur J Oper Res 156:2–22

    Article  MATH  Google Scholar 

  6. Dantzig B, Wolfe P (1960) The decomposition algorithm for linear programming. Oper Res 8:101–111

    Article  MATH  Google Scholar 

  7. Desrochers M, Desrosiers J, Solomon MM (1992) A New Optimization Algorithm for the Vehicle Routing Problem with time Windows. Oper Res 40(2):342–354

    Article  MathSciNet  MATH  Google Scholar 

  8. Eveborn P, Ronnqvist M (2004) Scheduler – A System for Staff Planning. Ann Oper Res 128:21–45

    Article  MATH  Google Scholar 

  9. Floudas CA (1995) Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford

    MATH  Google Scholar 

  10. Gilmore PC, Gomory RE (1961) A Linear Programming Approach to the Cutting Stock Problem. Oper Res 9:849–859

    Article  MathSciNet  MATH  Google Scholar 

  11. Gilmore PC, Gomory RE (1963) A Linear Programming Approach to the Cutting Stock Problem, Part II. Oper Res 11:863–888

    Article  MATH  Google Scholar 

  12. Grötschel M (2004) Mathematische Optimierung im industriellen Einsatz. In: Lecture at Siemens AG, Munich, Germany, 7 Dec 2004

    Google Scholar 

  13. Grötschel M (2005) Private communication

    Google Scholar 

  14. Harjunkoski I, Jain V, Grossmann IE (2000) Hybrid Mixed-integer constraint Logic Programming Strategies for Solving Scheduling and Combinatorial Optimization Problems. Comput Chem Eng 24:337–343

    Article  Google Scholar 

  15. Irnich S (2000) A Multi-Depot Pickup and Delivery Problem with a Single Hub and Heterogeneous Vehicles. Eur J Oper Res 122:310–328

    Article  MathSciNet  MATH  Google Scholar 

  16. Irnich S (2002) Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem. Dissertation, Fakultät für Wirtschaftswissenschaften, RWTH Aachen, Aachen, Germany

    Google Scholar 

  17. Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. IFORMS J Comput 13:258–276

    Article  MathSciNet  Google Scholar 

  18. Janak SL, Floudas CA, Kallrath J, Vormbrock N (2006) Production Scheduling of a Large-Scale Industrial Batch Plant: I. Short-Term and Medium-Term Scheduling. Ind Eng Chem Res 45:8234–8252

    Article  Google Scholar 

  19. Janak SL, Floudas CA, Kallrath J, Vormbrock N (2006) Production Scheduling of a Large-Scale Industrial Batch Plant: II. Reactive Scheduling. Ind Eng Chem Res 45:8253–8269

    Article  Google Scholar 

  20. Johnston RE, Sadinlija E (2004) A New Model for Complete Solutions to One-Dimensional Cutting Stock Problems. Eur J Oper Res 153:176–183

    Article  MathSciNet  MATH  Google Scholar 

  21. Kallrath J (2000) Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future Perspectives. Chem Eng Res Des 78(6):809–822

    Article  Google Scholar 

  22. Kallrath J (2004) Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions, vol 91 of Applied Optimization. Kluwer, Dordrecht

    Google Scholar 

  23. Kallrath J, Maindl TI (2006) Real Optimization with SAP-APO. Springer, Berlin

    MATH  Google Scholar 

  24. Lübbecke M, Zimmermann U (2003) Computer aided scheduling of switching engines. In: Jäger W, Krebs HJ (eds) Mathematics – Key Technology for the Future: Joint Projects Between Universities and Industry. Springer, Berlin, pp 690–702

    Google Scholar 

  25. Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007–1023

    Article  MathSciNet  MATH  Google Scholar 

  26. Lübbecke ME, Zimmermann UT (2003) Engine routing and scheduling at industrial in-plant railroads. Transp Sci 37(2):183–197

    Article  Google Scholar 

  27. Maravelias CT, Grossmann IE (2004) A Hybrid MILP/CP Decomposition Approach for the Continuous Time Scheduling of Multipurpose Batch Plants. Comput Chem Eng 28:1921–1949

    Article  Google Scholar 

  28. Martin A (2001) General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In: Naddef D, Juenger M (eds) Computational Combinatorial Optimization. Springer, Berlin, pp 1–25

    Chapter  Google Scholar 

  29. Menon S, Schrage L (2002) Order Allocation for Stock Cutting in the Paper Industry. Oper Res 50(2):324–332

    Article  MATH  Google Scholar 

  30. Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization. Wiley, New York

    MATH  Google Scholar 

  31. Pardalos PM (2001) Linear Programming. In: Floudas CA, Pardalos P (eds) Encyclopedia of Optimization, vol 3. Kluwer, Dordrecht, pp 186–188

    Google Scholar 

  32. Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming. Springer, Berlin

    MATH  Google Scholar 

  33. Roe B, Papageorgiou LG, Shah N (2005) A hybrid MILP/CLP Algorithm for Multipurpose Batch Process schedulin. Comput Chem Eng 29:1277–1291

    Article  Google Scholar 

  34. Savelsbergh MWP (2001) Branch-and-Price: Integer Programming with Column Generation. In: Floudas CA, Pardalos P (eds) Encyclopedia of Optimization. Kluwer, Dordrecht, pp 218–221

    Chapter  Google Scholar 

  35. Schrage L (2006) Optimization Modeling with LINGO. LINDO Systems, Chicago

    Google Scholar 

  36. Till J, Sand G, Engell S, Emmerich M, Schönemann L (2005) A New Hybrid Algorithm for Solving Two-Stage Stochastic Problems by Combining Evolutionary and Mathematical Programming Methods. In: Puigjaner L, Espuña A (eds) Proc. European Symposium on Computer Aided Process Engineering (ESCAPE) - 15. Dordrecht, North-Holland, pp 187–192

    Google Scholar 

  37. Timpe C (2002) Solving mixed planning and scheduling problems with mixed branch and bound and constraint programming. OR Spectrum 24:431–448

    Article  MATH  Google Scholar 

  38. Vanderbeck F (2000) Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper Res 48(5):915–926

    Article  MathSciNet  MATH  Google Scholar 

  39. Wolsey LA (1998) Integer Programming. Wiley, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GVC/S (Scientific Computing) - B009, BASF Aktiengesellschaft, Ludwigshafen, Germany

    Josef Kallrath

  2. Astronomy Department, University of Florida, Gainesville, USA

    Josef Kallrath

Authors
  1. Josef Kallrath
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Kallrath, J. (2008). Modeling Difficult Optimization Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_398

Download citation

Publish with us

Policies and ethics

Search

Navigation