{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T12:36:45Z","timestamp":1762173405792,"version":"build-2065373602"},"reference-count":133,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444527264"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80019-2","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"527-570","source":"Crossref","is-referenced-by-count":11,"title":["Operations Research Methods in Constraint Programming"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S1574-6526(06)80019-2_bib1","series-title":"ZIB-report, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin","article-title":"SCIP: A framework to integrate constraint and mixed integer programming","author":"Achterberg","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib2","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2001)","article-title":"LP probing for piecewise linear optimization in scheduling","author":"Ajili","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib3","series-title":"Constraint and Integer Programming: Toward a Unified Methodology","first-page":"169","article-title":"Hybrid problem solving in ECLiPSe","author":"Ajili","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM Journal of Optimization"},{"key":"10.1016\/S1574-6526(06)80019-2_bib5","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"364","article-title":"Linear programming relaxations of multiple all-different predicates","volume":"3011","author":"Appa","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib6","series-title":"Principles and Practice of Constraint Programming (CP2002)","first-page":"17","article-title":"Integrating constraint and integer programming for the orthogonal Latin squares problem","volume":"volume 2470","author":"Appa","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM Journal on Algebraic and Discrete Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial k-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM Journal on Algebraic and Discrete Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib9","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"21","article-title":"SIMPL: A system for integrating optimization techniques","volume":"volume 3011","author":"Aron","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-003-0432-4","article-title":"On unions and dominants of polytopes","volume":"99","author":"Balas","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80019-2_bib11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","article-title":"The volume algorithm: Producing primal solutions with a subgradient algorithm","volume":"87","author":"Barahona","year":"2000","journal-title":"Mathematical Programming"},{"year":"1995","series-title":"Logic-based 0-1 Constraint Solving in Constraint Logic Programming","author":"Barth","key":"10.1016\/S1574-6526(06)80019-2_bib12"},{"key":"10.1016\/S1574-6526(06)80019-2_bib13","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","article-title":"An algorithm for disjunctive programs","volume":"48","author":"Beaumont","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1021849405707","article-title":"A hybrid approach to scheduling with earliness and tardiness costs","volume":"118","author":"Beck","year":"2003","journal-title":"Annals of Operations Resarch"},{"key":"10.1016\/S1574-6526(06)80019-2_bib15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S1574-6526(06)80019-2_bib16","series-title":"Principles and Practice of Constraint Programming (CP2002)","first-page":"603","article-title":"Constraint programming contribution to Benders decomposition: A case study","volume":"volume 2470","author":"Benoist","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib17","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2001)","article-title":"Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems","author":"Benoist","year":"2001"},{"year":"1972","series-title":"Nonserial Dynamic Programming","author":"Bertele","key":"10.1016\/S1574-6526(06)80019-2_bib18"},{"volume":"1 and 2","year":"2001","author":"Bertsekas","key":"10.1016\/S1574-6526(06)80019-2_bib19"},{"key":"10.1016\/S1574-6526(06)80019-2_bib20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","article-title":"Branch-and-infer: A unifying framework for integer and finite domain constraint programming","volume":"10","author":"Bockmayr","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80019-2_bib21","series-title":"Constraint and Integer Programming: Toward a Unified Methodology","first-page":"59","article-title":"Branch-and-infer: A framework for combining CP and IP","author":"Bockmayr","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib22","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2003)","article-title":"Detecting infeasibility and generating cuts for mixed integer programming using constraint programming","author":"Bockmayr","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib23","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/opre.49.1.42.11196","article-title":"Optimal design of truss structures by mixed logical and linear programming","volume":"49","author":"Bollapragada","year":"2001","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib24","series-title":"Principles and Practice of Constraint Programming (CP2004)","first-page":"153","article-title":"Decomposition and learning for a hard real time task allocation problem","volume":"volume 3258","author":"Cambazard","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib25","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"94","article-title":"Identifying and exploiting problem structures using explanation-based constraint programming","volume":"volume 3524","author":"Cambazard","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib26","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 1999)","article-title":"A cooperative CP and LP optimizer approach for the pairing generation problem","author":"Chabrier","year":"2000"},{"key":"10.1016\/S1574-6526(06)80019-2_bib27","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2003)","article-title":"Heuristic branch-and-price-and-cut to solve a network design problem","author":"Chabrier","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib28","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.28.2.104","article-title":"Solving structured multifacility location problems efficiently","volume":"28","author":"Chhajed","year":"1994","journal-title":"Transportation Science"},{"key":"10.1016\/S1574-6526(06)80019-2_bib29","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"127","article-title":"Generating benders cuts for a class of integer programming problems","volume":"volume 3011","author":"Chu","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib30","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"110","article-title":"A hybrid algorithm for a class of resource-constrained scheduling problems","volume":"volume 3524","author":"Chu","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib31","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib32","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2002)","article-title":"Mosel: An extensible environment for modeling and programming solutions","author":"Colombani","year":"2002"},{"article-title":"Mosel: An overview","year":"2004","author":"Colombani","key":"10.1016\/S1574-6526(06)80019-2_bib33"},{"key":"10.1016\/S1574-6526(06)80019-2_bib34","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"370","article-title":"Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining constraint programming and mixed integer programming","volume":"volume 3011","author":"Corr\u00e9a","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib35","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","article-title":"The basic algorithm for pseudoboolean programming revisited","volume":"29","author":"Crama","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib36","series-title":"Principles and Practice of Constraint Programming (CP2004)","first-page":"726","article-title":"Strong cost-based filtering for Lagrange decomposition applied to network design","volume":"volume 3258","author":"Cronholm","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib37","series-title":"Constraint and Integer Programming: Toward a Unified Methodology","first-page":"33","article-title":"Two generic schemes for efficient and robust cooperative algorithms","author":"Danna","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib38","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2001)","article-title":"Branch-and-cut for combinatorial optimization problems without auxilliary variables","author":"de Farias","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib39","series-title":"Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI 96)","first-page":"211","article-title":"Bucket elimination: A unifying framework for several probabilistic inference algorithms","author":"Dechter","year":"1996"},{"key":"10.1016\/S1574-6526(06)80019-2_bib40","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2002)","article-title":"A hybrid constraint propagation-cutting plane procedure for the RCPSP","author":"Demassey","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib41","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"140","article-title":"Constraint-programming based column generation for employee timetabling","volume":"volume 3524","author":"Demassey","year":"2005"},{"year":"2003","series-title":"Dynamic Programming: Models and Applications","author":"Denardo","key":"10.1016\/S1574-6526(06)80019-2_bib42"},{"key":"10.1016\/S1574-6526(06)80019-2_bib43","series-title":"Principles and Practice of Constraint Programming (CP2001)","first-page":"580","article-title":"The traveling tournament problem description and benchmarks","volume":"volume 2239","author":"Easton","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib44","series-title":"Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002)","article-title":"Solving the traveling tournament problem: A combined integer programming and constraint programming approach","author":"Easton","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib45","series-title":"Constraint and Integer Programming: Toward a Unified Methodology","first-page":"207","article-title":"CP based branch and price","author":"Easton","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib46","series-title":"Principles and Practice of Constraint Programming (CP2001)","first-page":"1","article-title":"Hybrid Benders decomposition algorithm in constraint logic programming","volume":"volume 2239","author":"Eremin","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib47","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1013613701606","article-title":"Constraint programming based column generation for crew assignment","volume":"8","author":"Fahle","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib48","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2000)","first-page":"33","article-title":"Constraint programming based column generation with knapsack subproblems","author":"Fahle","year":"2000"},{"key":"10.1016\/S1574-6526(06)80019-2_bib49","series-title":"Combinatorial Optimization\u2014Eureka, You Shrink!, Papers Dedicated to Jack Edmonds","first-page":"64","article-title":"Solving real-world atsp instances by branch-and-cut","volume":"volume 2570","author":"Fischetti","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib50","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib51","series-title":"Principles and Practice of Constraint Programming (CP1999)","first-page":"189","article-title":"Cost-based domain filtering","volume":"volume 1713","author":"Focacci","year":"1999"},{"key":"10.1016\/S1574-6526(06)80019-2_bib52","series-title":"Principles and Practice of Constraint Programming (CP2000)","first-page":"187","article-title":"Cutting planes in constraint programming: An hybrid approach","volume":"volume 1894","author":"Focacci","year":"2000"},{"key":"10.1016\/S1574-6526(06)80019-2_bib53","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001)","article-title":"Connections and integrations of dynamic programming and constraint programming","author":"Focacci","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib54","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"201","article-title":"Shorter-path constraints for the resource constrained shortest path problem","volume":"volume 3524","author":"Gellermann","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib55","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"217","article-title":"Improving the cooperation between the master problem and the subproblem in constraint programming based column generation","volume":"volume 3524","author":"Gendron","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib56","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"Generalized benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S1574-6526(06)80019-2_bib57","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80019-2_bib58","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2002)","article-title":"The promise of LP to boost CSP techniques for combinatorial problems","author":"Gomes","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib59","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2003)","article-title":"Using constraint propagation to accelerate column generation in aircraft scheduling","author":"Gr\u00f6nkvist","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib60","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(94)90089-2","article-title":"Logic cuts for processing networks with fixed charges","volume":"21","author":"Grossmann","year":"1994","journal-title":"Computers and Operations Research"},{"year":"2002","series-title":"The Traveling Salesman Problem and Its Variations","key":"10.1016\/S1574-6526(06)80019-2_bib61"},{"key":"10.1016\/S1574-6526(06)80019-2_bib62","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1016\/S0098-1354(01)00729-3","article-title":"A decomposition approach for the scheduling of a steel plant production","volume":"25","author":"Harjunkoski","year":"2001","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S1574-6526(06)80019-2_bib63","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","article-title":"Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods","volume":"26","author":"Harjunkoski","year":"2002","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S1574-6526(06)80019-2_bib64","series-title":"Proceedings, 13th European Conference on Artificial Intelligence","first-page":"259","article-title":"Integrating constraint programming techniques into mathematical programming","author":"Heipcke","year":"1999"},{"year":"1999","series-title":"The OPL Optimization Programming Language","author":"Van Hentenryck","key":"10.1016\/S1574-6526(06)80019-2_bib65"},{"key":"10.1016\/S1574-6526(06)80019-2_bib66","series-title":"Principles and Practice of Constraint Programming (CP2003)","first-page":"407","article-title":"A hybrid constraint programming and semidefinite programming approach for the stable set problem","volume":"volume 2833","author":"Van Hoeve","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib67","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01531033","article-title":"Generalized resolution for 0\u20131 linear inequalities","volume":"6","author":"Hooker","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80019-2_bib68","series-title":"Principles and Practice of Constraint Programming (CP2002)","first-page":"336","article-title":"Logic-based methods for optimization","volume":"volume 874","author":"Hooker","year":"1994"},{"key":"10.1016\/S1574-6526(06)80019-2_bib69","series-title":"Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search","first-page":"1","article-title":"Constraint satisfaction methods for generating valid cuts","author":"Hooker","year":"1997"},{"year":"2000","series-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"Hooker","key":"10.1016\/S1574-6526(06)80019-2_bib70"},{"key":"10.1016\/S1574-6526(06)80019-2_bib71","series-title":"Principles and Practice of Constraint Programming (CP2004)","first-page":"305","article-title":"A hybrid method for planning and scheduling","volume":"volume 3258","author":"Hooker","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib72","series-title":"Principles and Practice of Constraint Programming (CP2005)","first-page":"314","article-title":"Planning and scheduling to minimize tardiness","volume":"volume 3709","author":"Hooker","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib73","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"243","article-title":"A search-infer-and-relax framework for integrating solution methods","volume":"volume 3524","author":"Hooker","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib74","unstructured":"J. N. Hooker. A hybrid method for planning and scheduling. Constraints, to appear."},{"key":"10.1016\/S1574-6526(06)80019-2_bib75","unstructured":"J. N. Hooker. Integrated Methods for Optimization. To appear."},{"key":"10.1016\/S1574-6526(06)80019-2_bib76","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1013195004424","article-title":"A declarative modeling framework that integrates solution methods","volume":"104","author":"Hooker","year":"2001","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib77","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","article-title":"Mixed logical\/linear programming","volume":"96\u201397","author":"Hooker","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib78","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","article-title":"Logic-based Benders decomposition","volume":"96","author":"Hooker","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80019-2_bib79","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1017\/S0269888900001077","article-title":"A scheme for unifying optimization and constraint satisfaction methods","volume":"15","author":"Hooker","year":"2000","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S1574-6526(06)80019-2_bib80","series-title":"Principles and Practice of Constraint Programming: The Newport Papers","first-page":"267","article-title":"Logic circuit verification by benders decomposition","author":"Hooker","year":"1995"},{"key":"10.1016\/S1574-6526(06)80019-2_bib81","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","article-title":"Algorithms for hybrid MILP\/CP models for a class of optimization problems","volume":"13","author":"Jain","year":"2001","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80019-2_bib82","series-title":"Principles and Practice of Constraint Programming (CP1999)","first-page":"261","article-title":"A framework for constraint programming based column generation","volume":"volume 1713","author":"Junker","year":"1999"},{"article-title":"The versatility of using explanations within constraint programming","year":"2003","author":"Jussien","key":"10.1016\/S1574-6526(06)80019-2_bib83"},{"key":"10.1016\/S1574-6526(06)80019-2_bib84","series-title":"Eleventh Workshop on Logic Programming environments (WLPE 2001)","article-title":"User-friendly explanations for constraint programming","author":"Jussien","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib85","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"258","article-title":"Combining arc consistency and dual Lagrangean relaxation for filtering CSPs","volume":"volume 3524","author":"Khemmoudj","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib86","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1021145103592","article-title":"Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach","volume":"115","author":"Kim","year":"2002","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib87","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2000)","article-title":"Application of OR and CP techniques in a real world crew scheduling system","author":"Kohl","year":"2000"},{"key":"10.1016\/S1574-6526(06)80019-2_bib88","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","volume":"50","author":"Lauritzen","year":"1988","journal-title":"Journal of the Royal Statistical Society B"},{"key":"10.1016\/S1574-6526(06)80019-2_bib89","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","article-title":"Generalized disjunctive programming: Nonlinear convex hull relaxation and algorithms","volume":"26","author":"Lee","year":"2003","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S1574-6526(06)80019-2_bib90","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1016\/S0098-1354(03)00098-X","article-title":"Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: Applications to process networks","volume":"27","author":"Lee","year":"2003","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S1574-6526(06)80019-2_bib91","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combintaorial Optimization Problems (CPAIOR 2003)","article-title":"Discrepancy-based additive bounding","author":"Lodi","year":"2003"},{"key":"10.1016\/S1574-6526(06)80019-2_bib92","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"1","article-title":"Using MILP and CP for the scheduling of batch chemical processes","volume":"volume 3011","author":"Maravelias","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib93","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","article-title":"Cutting planes in integer and mixed integer programming","volume":"123","author":"Marchand","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1574-6526(06)80019-2_bib94","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","article-title":"Aghgregation and mixed integer rounding to solve mips","volume":"49","author":"Marchand","year":"2001","journal-title":"Operations Research"},{"year":"1990","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","key":"10.1016\/S1574-6526(06)80019-2_bib95"},{"key":"10.1016\/S1574-6526(06)80019-2_bib96","series-title":"Principles and Practice of Constraint Programming (CP2002)","first-page":"1","article-title":"Reduced cost-based ranking for generating promising subproblems","volume":"volume 2470","author":"Milano","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib97","series-title":"The Traveling Salesman Problem and Its Variations","first-page":"29","article-title":"Polyhedral theory and branch-and-cut algorithms for the symmetric TSP","author":"Naddef","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib98","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","article-title":"Incremental subgradient methods for nondifferentiable optimization","volume":"12","author":"Nedic","year":"2001","journal-title":"SIAM Journal on Optimization"},{"year":"1999","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/S1574-6526(06)80019-2_bib99"},{"key":"10.1016\/S1574-6526(06)80019-2_bib100","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001)","article-title":"Logic cuts using surrogate constraint analysis in the multi-dimensional knapsack problem","author":"Osorio","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib101","series-title":"Proceedings of CP99 Post-Conference Workshop on Large-Scale Combinatorial Optimization and Constraints","first-page":"57","article-title":"Mixed global constraints and inference in hybrid IP-CLP solvers","author":"Ottosson","year":"1999"},{"key":"10.1016\/S1574-6526(06)80019-2_bib102","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1014440424150","article-title":"Mixed global constraints and inference in hybrid CLP-IP solvers","volume":"34","author":"Ottosson","year":"2002","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80019-2_bib103","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01580850","article-title":"An efficient algorithm for the minimum capacity cut problem","volume":"47","author":"Padberg","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80019-2_bib104","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","article-title":"Modeling and computational techniques for logic based integer programming","volume":"18","author":"Raman","year":"1994","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S1574-6526(06)80019-2_bib105","series-title":"Principles and Practice of Constraint Programming (CP1999)","first-page":"375","article-title":"Tight cooperation and its application in piecewise linear optimization","volume":"volume 1713","author":"Refalo","year":"1999"},{"key":"10.1016\/S1574-6526(06)80019-2_bib106","series-title":"Principles and Practice of Constraint Programming (CP2000)","first-page":"369","article-title":"Linear formulation of constraint programming models and hybrid solvers","volume":"volume 1894","author":"Refalo","year":"2000"},{"key":"10.1016\/S1574-6526(06)80019-2_bib107","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1018904229454","article-title":"A new approach to integrating mixed integer programming and constraint logic programming","volume":"86","author":"Rodo\u0161ek","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib108","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"402","article-title":"Stabilization issues for constraint programming based column generation","volume":"volume 3011","author":"Rousseau","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib109","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2002)","article-title":"Solving small VRPTWs with constraint programming based column generation","author":"Rousseau","year":"2002"},{"key":"10.1016\/S1574-6526(06)80019-2_bib110","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"409","article-title":"A hybrid branch-and-cut algorithm for the one-machine scheduling problem","volume":"volume 3011","author":"Sadykov","year":"2004"},{"article-title":"A cutting plane method for solving linear generalized disjunctive programming problems","year":"2004","author":"Sawaya","key":"10.1016\/S1574-6526(06)80019-2_bib111"},{"article-title":"Computational implementation of non-linear convex hull reformulations","year":"2005","author":"Sawaya","key":"10.1016\/S1574-6526(06)80019-2_bib112"},{"key":"10.1016\/S1574-6526(06)80019-2_bib113","series-title":"Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001)","article-title":"Constraint programming based Lagrangian relaxation for a multimedia application","author":"Sellmann","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib114","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1021105422248","article-title":"Crew assignment via constraint programming: Integrating column generation and heuristic tree search","volume":"115","author":"Sellmann","year":"2002","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib115","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0888-613X(87)90024-7","article-title":"Propagating belief functions in qualitative markov trees","volume":"1","author":"Shafer","year":"1987","journal-title":"International Journal of Approximate Reasoning"},{"key":"10.1016\/S1574-6526(06)80019-2_bib116","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"320","article-title":"A SAT-based decision procedure for mixed logical\/integer linear problems","volume":"volume 3524","author":"Sheini","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib117","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MEX.1986.4306979","article-title":"Propagating belief functions with local computation","volume":"1","author":"Shenoy","year":"1986","journal-title":"IEEE Expert"},{"key":"10.1016\/S1574-6526(06)80019-2_bib118","series-title":"National Conference on Artificial Intelligence (AAAI 1996)","first-page":"318","article-title":"Inference-based constraint satisfaction supports explanation","author":"Sqalli","year":"1996"},{"key":"10.1016\/S1574-6526(06)80019-2_bib119","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","article-title":"A branch-and-cut method for 0\u20131 mixed convex programming","volume":"86","author":"Stubbs","year":"1999","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80019-2_bib120","series-title":"Principles and Practice of Constraint Programming (CP2001)","first-page":"16","article-title":"Branch and check: A hybrid framework integrating mixed integer programming and constraint logic programming","volume":"volume 2239","author":"Thorsteinsson","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib121","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1021136801775","article-title":"Linear relaxations and reduced-cost based propagation of continuous variable subscripts","volume":"115","author":"Thorsteinsson","year":"2001","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80019-2_bib122","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-002-0107-1","article-title":"Solving planning and scheduling problems with combined integer and constraint programming","volume":"24","author":"Timpe","year":"2002","journal-title":"OR Spectrum"},{"key":"10.1016\/S1574-6526(06)80019-2_bib123","series-title":"Proceedings, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001)","first-page":"113","article-title":"A dynamic programming approach for consistency and propagation for knapsack constraints","author":"Trick","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib124","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005)","first-page":"366","article-title":"Formulations and reformulations in integer programming","volume":"volume 3524","author":"Trick","year":"2005"},{"key":"10.1016\/S1574-6526(06)80019-2_bib125","first-page":"409","article-title":"Characterization and formulation of disjunctions and their relaxations","volume":"volume 1","author":"Vecchietti","year":"2001"},{"key":"10.1016\/S1574-6526(06)80019-2_bib126","first-page":"159","article-title":"ECLiPSe: A platform for constraint logic programming","volume":"12","author":"Wallace","year":"1997","journal-title":"ICL Systems Journal"},{"year":"1999","series-title":"Model Building in Mathematical Programming","author":"Williams","key":"10.1016\/S1574-6526(06)80019-2_bib127"},{"key":"10.1016\/S1574-6526(06)80019-2_bib128","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","article-title":"Representations of the all_different predicate of constraint satisfaction in integer programming","volume":"13","author":"Williams","year":"2001","journal-title":"INFORMS Journal on Computing"},{"year":"2000","series-title":"Handbook of Semidefinite Programming","key":"10.1016\/S1574-6526(06)80019-2_bib129"},{"year":"1998","series-title":"Integer Programming","author":"Wolsey","key":"10.1016\/S1574-6526(06)80019-2_bib130"},{"key":"10.1016\/S1574-6526(06)80019-2_bib131","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004)","first-page":"348","article-title":"Problem decomposition for traffic diversions","volume":"volume 3011","author":"Xia","year":"2004"},{"key":"10.1016\/S1574-6526(06)80019-2_bib132","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s101070050061","article-title":"Tight representations of logical constraints as cardinality rules","volume":"85","author":"Yan","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80019-2_bib133","unstructured":"T. H. Yunes, A. V. Moura, and C. C. de Souza. Hybrid column generation approaches for urban transit crew management problems. Transportation Science, to appear."}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:53:21Z","timestamp":1761620001000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":133,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80019-2","relation":{},"ISSN":["1574-6526"],"issn-type":[{"type":"print","value":"1574-6526"}],"subject":[],"published":{"date-parts":[[2006]]}}}