{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:49:30Z","timestamp":1743043770145,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":53,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_396","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2270-2276","source":"Crossref","is-referenced-by-count":0,"title":["Mixed Integer Programming\/Constraint Programming Hybrid Methods"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Aggoun","sequence":"first","affiliation":[]},{"given":"Christos","family":"Maravelias","sequence":"additional","affiliation":[]},{"given":"Alkis","family":"Vazacopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"396_CR1_396","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun A, Beldiceanu N (1993) Extending CHIP in order to solve complex scheduling problems. J\u00a0Math Comput Model 17(7):57\u201373","journal-title":"J Math Comput Model"},{"key":"396_CR2_396","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-540-24734-0_15","volume-title":"Economics, Management and Optimization in Sports","author":"A Aggoun","year":"2004","unstructured":"Aggoun A, Vazacopoulos A (2004) Solving sports scheduling and timetabling\n\t  problems with constraint programming. In: Butenko S, Gil-Lafuente J, Pardalos PM (eds) Economics, Management and Optimization in Sports. Springer, Dordrecht, pp 243\u2013264"},{"key":"396_CR3_396","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E Balas","year":"1965","unstructured":"Balas E (1965) An Additive Algorithm for Solving Linear Programs with 0\u20131 Variables. Oper Res 13:517\u2013546","journal-title":"Oper Res"},{"key":"396_CR4_396","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas E (1975) Facets of the Knapsack Polytope. Math Program 8:146\u2013164","journal-title":"Math Program"},{"key":"396_CR5_396","unstructured":"Balas E (2001) Integer Programming. In: Floudas T, Pardalos P (eds) Encyclopedia of Optimization, vol\u00a02. Kluwer, pp\u00a0492\u2013499"},{"issue":"4","key":"396_CR6_396","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1080\/095119296131616","volume":"9","author":"P Baptiste","year":"1996","unstructured":"Baptiste P, Le Pape C (1996) Disjunctive Constraints for Manufacturing Scheduling: Principles and Extensions. Int J Comput Integr Manuf 9(4):306\u20133410","journal-title":"Int J Comput Integr Manuf"},{"key":"396_CR7_396","unstructured":"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"},{"key":"396_CR8_396","doi-asserted-by":"crossref","unstructured":"Baptiste P, Le Pape C, Nuijten W (2001) Constrained-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"396_CR9_396","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning Procedures for Solving Mixed Variables Programming Problems. Numer Math 4:238\u2013252","journal-title":"Numer Math"},{"issue":"3","key":"396_CR10_396","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A Bockmayr","year":"1998","unstructured":"Bockmayr A, Kasper T (1998) Branch and Infer: A\u00a0Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS J Comput 10(3):287\u2013300","journal-title":"INFORMS J Comput"},{"key":"#cr-split#-396_CR11_396.1","unstructured":"Bockmayr A, Pisaruk N (2003) Detecting Infeasibility and Generating Cuts for MIP"},{"key":"#cr-split#-396_CR11_396.2","unstructured":"Using CP. In: Proc CP-AI-OR 2003. Montreal, pp 24-34"},{"key":"396_CR12_396","unstructured":"Caseau Y, Laburthe F (1994) Improved CLP Scheduling with Task Intervals. In: Proc 11th Int Conf Log Program"},{"key":"396_CR13_396","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chvatal","year":"1973","unstructured":"Chvatal V (1973) Edmonds Polytops and a\u00a0Hierarchy of Combinatorial Problems. Discret Math 4:305\u2013337","journal-title":"Discret Math"},{"key":"396_CR14_396","unstructured":"Constantino M (2003) Integrated Lot-sizing and Scheduling of Barbot's Paint Production Using Combined MIP\/CP. LISCOS Project Summary Meeting"},{"key":"396_CR15_396","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin RJ (1965) A\u00a0Tree Search Algorithm for Mixed Integer Programming Problems. Comput J 8:250\u2013255","journal-title":"Comput J"},{"key":"396_CR16_396","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The Lagrangean Relaxation Method for Solving Integer Programming Problems. Manag Sci 27:1\u201318","journal-title":"Manag Sci"},{"key":"396_CR17_396","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory RE (1958) Outline of an Algorithm for Integer Solutions to Linear Programs. Bull Am Math Soc 64:275\u2013278","journal-title":"Bull Am Math Soc"},{"key":"396_CR18_396","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory RE (1963) An Algorithm for Integer Solutions to Linear Programs. In: Graves\n\t  R, Wolfe P (eds) Recent Advances in Mathematical Programming. McGraw Hill, New York, pp 269\u2013302"},{"key":"396_CR19_396","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard M, Kim S (1987) Lagrangean Decomposition: A\u00a0Model Yielding Stronger Lagrangean Bounds. Math Program 39:215\u2013228","journal-title":"Math Program"},{"key":"396_CR20_396","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I Harjunkoski","year":"2002","unstructured":"Harjunkoski I, Grossmann IE (2002) Decomposition Techniques for Multistage Scheduling Problems Using Mixed-Integer and Constrained Programming Methods. Comp Chem Eng 26:1533\u20131552","journal-title":"Comp Chem Eng"},{"issue":"1","key":"396_CR21_396","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/S1571-0653(05)80001-0","volume":"1","author":"S Heipcke","year":"1999","unstructured":"Heipcke S (1999) An Example of Integrating Constraint Programming and Mathematical Programming. Electron Note Discret Math 1(1):84","journal-title":"Electron Note Discret Math"},{"key":"396_CR22_396","unstructured":"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\u2013141"},{"key":"396_CR23_396","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"97","author":"JN Hooker","year":"1999","unstructured":"Hooker JN, Osorio MA (1999) Mixed Logic \/ Linear Programming. Discret Appl Math 97:395\u2013442","journal-title":"Discret Appl Math"},{"key":"396_CR24_396","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"JN Hooker","year":"2000","unstructured":"Hooker JN (2000) Logic Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York"},{"key":"396_CR25_396","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1017\/S0269888900001077","volume":"15","author":"JN Hooker","year":"2000","unstructured":"Hooker JN, Ottosson G, Thornsteinsson ES, Kim HJ (2000) A\u00a0Scheme for Unifying Optimization and Constraint Satisfaction Methods. Knowl Eng Rev 15:11\u201330","journal-title":"Knowl Eng Rev"},{"issue":"4","key":"396_CR26_396","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"JN Hooker","year":"2002","unstructured":"Hooker JN (2002) Logic, Optimization, and Constraint Programming. INFORMS J Comput 14(4):295\u2013321","journal-title":"INFORMS J Comput"},{"key":"396_CR27_396","volume-title":"Integrated Methods for Optimization","author":"JN Hooker","year":"2006","unstructured":"Hooker JN (2006) Integrated Methods for Optimization. Springer, Dordrecht"},{"key":"396_CR28_396","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V Jain","year":"2001","unstructured":"Jain V, Grossmann IE (2001) Algorithms for Hybrid MIP\/CP Model for a\u00a0Class of Optimization Problems. INFORMS J Comput 13:258\u2013276","journal-title":"INFORMS J Comput"},{"issue":"20","key":"396_CR29_396","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J Jaffar","year":"1994","unstructured":"Jaffar J, Maher M (1994) Constraint Logic Programming. Surv J Log Program 19(20):503\u2013581","journal-title":"Surv J Log Program"},{"key":"396_CR30_396","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"EL Johnson","year":"2000","unstructured":"Johnson EL, Nemhauser GL, Savelsbergh MWP (2000) Progress in Linear Programming Based Branch-and-Bound Algorithms: Exposition. INFORMS J Comput 12:2\u201323","journal-title":"INFORMS J Comput"},{"key":"396_CR31_396","first-page":"83","volume":"28","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic Method for Solving Discrete Programming Models. Econom 28:83\u201397","journal-title":"Econom"},{"issue":"2","key":"396_CR32_396","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C Le Pape","year":"1998","unstructured":"Le Pape C (1998) Implementation of Resource constraints in ILOG SCHEDULE: A\u00a0Library for the Development of Constrained-Based Scheduling Systems. Intell Syst Eng 3(2):55\u201366","journal-title":"Intell Syst Eng"},{"key":"396_CR33_396","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1016\/j.compchemeng.2004.03.016","volume":"28","author":"CT Maravelias","year":"2004","unstructured":"Maravelias CT, Grossmann IE (2004) A\u00a0Hybrid MIP\/CP Decomposition Approach for the Short Term Scheduling of Multipurpose Plants. Comput Chem Eng 28:1921\u20131949","journal-title":"Comput Chem Eng"},{"key":"396_CR34_396","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-24664-0_1","volume":"3011","author":"CT Maravelias","year":"2004","unstructured":"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\u201320","journal-title":"Lect Note Comput Sci"},{"issue":"3","key":"396_CR35_396","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.compchemeng.2005.09.011","volume":"30","author":"CT Maravelias","year":"2006","unstructured":"Maravelias CT (2006) A\u00a0Decomposition Framework for the Scheduling of Single- and Multi-stage Processes. Comput Chem Eng 30(3):407\u2013420","journal-title":"Comput Chem Eng"},{"key":"396_CR36_396","volume-title":"Introduction to Constraint Logic Programming","author":"K Marriott","year":"1999","unstructured":"Marriott K, Stuckey PJ (1999) Introduction to Constraint Logic Programming. MIT Press, Cambridge, MA"},{"key":"396_CR37_396","volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","author":"M Milano","year":"2003","unstructured":"Milano M (2003) Constraint and Integer Programming: Toward a\u00a0Unified\n\t  Methodology. Springer, Dordrecht"},{"key":"396_CR38_396","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1989","unstructured":"Nemhauser GL, Wolsey LA (1989) Integer and Combinatorial Optimization. Wiley, New York"},{"key":"396_CR39_396","unstructured":"Nuijten WPM (1994) Time and Resource Constrained Scheduling: A\u00a0Constraint Satisfaction Approach. PhD Thesis, Eindhoven University of Technology"},{"key":"396_CR40_396","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg MW, van Roy TJ, Wolsey LA (1985) Valid Linear Inequalities for Fixed Charged Problems. Oper Res 33:842\u2013861","journal-title":"Oper Res"},{"key":"396_CR41_396","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2001","unstructured":"Pinedo M (2001) Scheduling: Theory, Algorithms, and Systems. Prentice Hall,\n\t  Englewood Cliffs"},{"key":"396_CR42_396","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R Rodosek","year":"1999","unstructured":"Rodosek R, Wallace MG, Hajian MT (1999) A\u00a0New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming. Ann Oper Res 86:63\u201387","journal-title":"Ann Oper Res"},{"issue":"2","key":"396_CR43_396","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.1040.0110","volume":"18","author":"R Sadykov","year":"2006","unstructured":"Sadykov R, Wolsey L (2006) Integer and Constraint Programming in Solving a\u00a0Multi-Machine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J Comput 18(2):209\u2013217","journal-title":"INFORMS J Comput"},{"key":"396_CR44_396","first-page":"1","volume":"1034","author":"H Simonis","year":"1995","unstructured":"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\u201321","journal-title":"Lect Note Comput Sci"},{"key":"396_CR45_396","unstructured":"Smith SF, Cheng C-C (1993) Slack-based Heuristics for Constrained Satisfaction Scheduling. In: Proc 11th National Conf Artif Intell"},{"key":"396_CR46_396","unstructured":"Timpe C (2003) Solving BASF's Plastics Production and Lot-sizing Problem Using Combined CP\/MIP. LISCOS Project Summary Meeting"},{"key":"396_CR47_396","volume-title":"Constraint Satisfaction in Logic Programming","author":"P van Hentenryck","year":"1989","unstructured":"van Hentenryck P (1989) Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA"},{"issue":"4","key":"396_CR48_396","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P van Hentenryck","year":"2002","unstructured":"van Hentenryck P (2002) Constraint and Integer Programming in OPL. INFORMS J Comput 14(4):345\u2013372","journal-title":"INFORMS J Comput"},{"key":"396_CR49_396","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/0-387-26281-4_12","volume-title":"Supply Chain Optimization I","author":"A Vazacopoulos","year":"2005","unstructured":"Vazacopoulos A, Verma N (2005) Hybrid MIP-CP techniques to solve the Multi-Machine\n\t  Assignment and Scheduling Problem in Xpress-CP. In: Geunes J, Pardalos PM (eds) Supply Chain Optimization I. Springer, Dordrecht, pp\u00a0391\u2013413"},{"key":"396_CR50_396","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey LA (1975) Faces for a\u00a0Linear Inequality in 0\u20131 Variables. Math Program 8:165\u2013178","journal-title":"Math Program"},{"key":"396_CR51_396","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"25","author":"LA Wolsey","year":"1990","unstructured":"Wolsey LA (1990) Valid Inequalities for Mixed-Integer Programs with Generalized and Variable Upper Bound Constraints. Discret Appl Math 25:251\u2013261","journal-title":"Discret Appl Math"},{"key":"396_CR52_396","volume-title":"Integer Programming","author":"L Wolsey","year":"1998","unstructured":"Wolsey L (1998) Integer Programming. Wiley, New York"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:44:33Z","timestamp":1720691073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_396","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}