Skip to main content
SpringerLink
Log in

Mixed Integer Programming/Constraint Programming Hybrid Methods

  • Reference work entry
Encyclopedia of Optimization

  • 356 Accesses

Article Outline

Background

  Mixed-Integer Programming

  Constraint Programming

Methods

Applications

Conclusions

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. Aggoun A, Beldiceanu N (1993) Extending CHIP in order to solve complex scheduling problems. J Math Comput Model 17(7):57–73

    Article  Google Scholar 

  2. Aggoun A, Vazacopoulos A (2004) Solving sports scheduling and timetabling problems with constraint programming. In: Butenko S, Gil-Lafuente J, Pardalos PM (eds) Economics, Management and Optimization in Sports. Springer, Dordrecht, pp 243–264

    Google Scholar 

  3. Balas E (1965) An Additive Algorithm for Solving Linear Programs with 0–1 Variables. Oper Res 13:517–546

    Article  MathSciNet  Google Scholar 

  4. Balas E (1975) Facets of the Knapsack Polytope. Math Program 8:146–164

    Article  MathSciNet  MATH  Google Scholar 

  5. Balas E (2001) Integer Programming. In: Floudas T, Pardalos P (eds) Encyclopedia of Optimization, vol 2. Kluwer, pp 492–499

    Google Scholar 

  6. Baptiste P, Le Pape C (1996) Disjunctive Constraints for Manufacturing Scheduling: Principles and Extensions. Int J Comput Integr Manuf 9(4):306–3410

    Article  Google Scholar 

  7. Baptiste P, Le Pape C (1996) Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. In: Proc 15th Workshop of the UK Planning Special Interest Group

    Google Scholar 

  8. Baptiste P, Le Pape C, Nuijten W (2001) Constrained-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer

    Google Scholar 

  9. Benders JF (1962) Partitioning Procedures for Solving Mixed Variables Programming Problems. Numer Math 4:238–252

    Article  MathSciNet  MATH  Google Scholar 

  10. Bockmayr A, Kasper T (1998) Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS J Comput 10(3):287–300

    Article  MathSciNet  MATH  Google Scholar 

  11. Bockmayr A, Pisaruk N (2003) Detecting Infeasibility and Generating Cuts for MIP Using CP. In: Proc CP-AI-OR 2003. Montreal, pp 24–34

    Google Scholar 

  12. Caseau Y, Laburthe F (1994) Improved CLP Scheduling with Task Intervals. In: Proc 11th Int Conf Log Program

    Google Scholar 

  13. Chvatal V (1973) Edmonds Polytops and a Hierarchy of Combinatorial Problems. Discret Math 4:305–337

    Article  MathSciNet  MATH  Google Scholar 

  14. Constantino M (2003) Integrated Lot-sizing and Scheduling of Barbot's Paint Production Using Combined MIP/CP. LISCOS Project Summary Meeting

    Google Scholar 

  15. Dakin RJ (1965) A Tree Search Algorithm for Mixed Integer Programming Problems. Comput J 8:250–255

    Article  MathSciNet  MATH  Google Scholar 

  16. Fisher ML (1981) The Lagrangean Relaxation Method for Solving Integer Programming Problems. Manag Sci 27:1–18

    Article  MATH  Google Scholar 

  17. Gomory RE (1958) Outline of an Algorithm for Integer Solutions to Linear Programs. Bull Am Math Soc 64:275–278

    Article  MathSciNet  MATH  Google Scholar 

  18. Gomory RE (1963) An Algorithm for Integer Solutions to Linear Programs. In: Graves R, Wolfe P (eds) Recent Advances in Mathematical Programming. McGraw Hill, New York, pp 269–302

    Google Scholar 

  19. Guignard M, Kim S (1987) Lagrangean Decomposition: A Model Yielding Stronger Lagrangean Bounds. Math Program 39:215–228

    Article  MathSciNet  MATH  Google Scholar 

  20. Harjunkoski I, Grossmann IE (2002) Decomposition Techniques for Multistage Scheduling Problems Using Mixed-Integer and Constrained Programming Methods. Comp Chem Eng 26:1533–1552

    Article  Google Scholar 

  21. Heipcke S (1999) An Example of Integrating Constraint Programming and Mathematical Programming. Electron Note Discret Math 1(1):84

    MathSciNet  Google Scholar 

  22. Hooker JN, Ottosson G, Thorsteinsson ES, Kim HJ (1999) On integrating constraint propagation and linear programming for combinatorial optimization. In: Proc 16th National Conf Artif Intell (AAAI-99), AAAI, The AAAI Press/MIT Press, Cambridge, pp 136–141

    Google Scholar 

  23. Hooker JN, Osorio MA (1999) Mixed Logic / Linear Programming. Discret Appl Math 97:395–442

    Article  MathSciNet  Google Scholar 

  24. Hooker JN (2000) Logic Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York

    MATH  Google Scholar 

  25. Hooker JN, Ottosson G, Thornsteinsson ES, Kim HJ (2000) A Scheme for Unifying Optimization and Constraint Satisfaction Methods. Knowl Eng Rev 15:11–30

    Article  Google Scholar 

  26. Hooker JN (2002) Logic, Optimization, and Constraint Programming. INFORMS J Comput 14(4):295–321

    Article  MathSciNet  Google Scholar 

  27. Hooker JN (2006) Integrated Methods for Optimization. Springer, Dordrecht

    Google Scholar 

  28. Jain V, Grossmann IE (2001) Algorithms for Hybrid MIP/CP Model for a Class of Optimization Problems. INFORMS J Comput 13:258–276

    Article  MathSciNet  Google Scholar 

  29. Jaffar J, Maher M (1994) Constraint Logic Programming. Surv J Log Program 19(20):503–581

    Article  MathSciNet  Google Scholar 

  30. Johnson EL, Nemhauser GL, Savelsbergh MWP (2000) Progress in Linear Programming Based Branch-and-Bound Algorithms: Exposition. INFORMS J Comput 12:2–23

    Article  MathSciNet  MATH  Google Scholar 

  31. Land AH, Doig AG (1960) An automatic Method for Solving Discrete Programming Models. Econom 28:83–97

    MathSciNet  Google Scholar 

  32. Le Pape C (1998) Implementation of Resource constraints in ILOG SCHEDULE: A Library for the Development of Constrained-Based Scheduling Systems. Intell Syst Eng 3(2):55–66

    Google Scholar 

  33. Maravelias CT, Grossmann IE (2004) A Hybrid MIP/CP Decomposition Approach for the Short Term Scheduling of Multipurpose Plants. Comput Chem Eng 28:1921–1949

    Article  Google Scholar 

  34. Maravelias CT, Grossmann IE (2004) Using MILP and CP for the Scheduling of Batch Chemical Processes. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lect Note Comput Sci 3011:1–20

    Google Scholar 

  35. Maravelias CT (2006) A Decomposition Framework for the Scheduling of Single- and Multi-stage Processes. Comput Chem Eng 30(3):407–420

    Article  Google Scholar 

  36. Marriott K, Stuckey PJ (1999) Introduction to Constraint Logic Programming. MIT Press, Cambridge, MA

    Google Scholar 

  37. Milano M (2003) Constraint and Integer Programming: Toward a Unified Methodology. Springer, Dordrecht

    Google Scholar 

  38. Nemhauser GL, Wolsey LA (1989) Integer and Combinatorial Optimization. Wiley, New York

    Google Scholar 

  39. Nuijten WPM (1994) Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. PhD Thesis, Eindhoven University of Technology

    Google Scholar 

  40. Padberg MW, van Roy TJ, Wolsey LA (1985) Valid Linear Inequalities for Fixed Charged Problems. Oper Res 33:842–861

    Article  MathSciNet  MATH  Google Scholar 

  41. Pinedo M (2001) Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs

    Google Scholar 

  42. Rodosek R, Wallace MG, Hajian MT (1999) A New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming. Ann Oper Res 86:63–87

    Article  MathSciNet  MATH  Google Scholar 

  43. Sadykov R, Wolsey L (2006) Integer and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J Comput 18(2):209–217

    Article  MathSciNet  Google Scholar 

  44. Simonis H (1995) Application Development with the CHIP System. In: Proc ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications. Lect Note Comput Sci 1034:1–21

    Google Scholar 

  45. Smith SF, Cheng C-C (1993) Slack-based Heuristics for Constrained Satisfaction Scheduling. In: Proc 11th National Conf Artif Intell

    Google Scholar 

  46. Timpe C (2003) Solving BASF's Plastics Production and Lot-sizing Problem Using Combined CP/MIP. LISCOS Project Summary Meeting

    Google Scholar 

  47. van Hentenryck P (1989) Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA

    Google Scholar 

  48. van Hentenryck P (2002) Constraint and Integer Programming in OPL. INFORMS J Comput 14(4):345–372

    Article  MathSciNet  Google Scholar 

  49. Vazacopoulos A, Verma N (2005) Hybrid MIP-CP techniques to solve the Multi-Machine Assignment and Scheduling Problem in Xpress-CP. In: Geunes J, Pardalos PM (eds) Supply Chain Optimization I. Springer, Dordrecht, pp 391–413

    Chapter  Google Scholar 

  50. Wolsey LA (1975) Faces for a Linear Inequality in 0–1 Variables. Math Program 8:165–178

    Article  MathSciNet  MATH  Google Scholar 

  51. Wolsey LA (1990) Valid Inequalities for Mixed-Integer Programs with Generalized and Variable Upper Bound Constraints. Discret Appl Math 25:251–261

    Article  MathSciNet  Google Scholar 

  52. Wolsey L (1998) Integer Programming. Wiley, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KLS-OPTIM, Villebon sur Yvette, France

    Abderrahmane Aggoun

  2. University of Wisconsin – Madison, Madison, USA

    Christos Maravelias

  3. Dash Optimization, Englewood Cliffs, USA

    Alkis Vazacopoulos

Authors
  1. Abderrahmane Aggoun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Maravelias
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alkis Vazacopoulos
    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

Aggoun, A., Maravelias, C., Vazacopoulos, A. (2008). Mixed Integer Programming/Constraint Programming Hybrid Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_396

Download citation

Publish with us

Policies and ethics

Search

Navigation