{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:25:36Z","timestamp":1777501536349,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681540","type":"print"},{"value":"9783540681557","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_4","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T09:41:20Z","timestamp":1211190080000},"page":"6-20","source":"Crossref","is-referenced-by-count":97,"title":["Constraint Integer Programming: A New Approach to Integrate CP and MIP"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kati","family":"Wolter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optimization\u00a04(1), 4\u201320 (2007) (Special issue: Mixed Integer Programming)","journal-title":"Discrete Optimization"},{"key":"4_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007), http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2007\/1611\/"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters\u00a033, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters\u00a034(4), 1\u201312 (2006), http:\/\/miplib.zib.de","journal-title":"Operations Research Letters"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45749-6_11","volume-title":"Algorithms - ESA 2002","author":"E. Althaus","year":"2002","unstructured":"Althaus, E., Bockmayr, A., Elf, M., J\u00fcnger, M., Kasper, T., Mehlhorn, K.: SCIL \u2013 symbolic constraints in integer linear programming. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 75\u201387. Springer, Heidelberg (2002)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G. Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding $\\{0,\\frac{1}{2}\\}$ -cuts in a branch-and-cut framework: A computational study. INFORMS Journal on Computing\u00a019(2), 229\u2013238 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR7","volume-title":"The Traveling Salesman Problem","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2006)"},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-24664-0_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"I.D. Aron","year":"2004","unstructured":"Aron, I.D., Hooker, J.N., Yunes, T.H.: SIMPL: A system for integrating optimization techniques. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 21\u201336. Springer, Heidelberg (2004)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming\u00a08, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science\u00a042, 1229\u20131246 (1996)","journal-title":"Management Science"},{"key":"4_CR12","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"4_CR13","unstructured":"Berthold, T.: Heuristics of the branch-cut-and-price-framework SCIP. ZIB-Report 07-30, Zuse Institute Berlin, Operations Research 2007 (to appear, 2007)"},{"issue":"3","key":"4_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., Kasper, T.: Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing\u00a010(3), 287\u2013300 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR15","unstructured":"Bockmayr, A., Pisaruk, N.: Solving assembly line balancing problems by combining IP and CP. In: Sixth Annual Workshop of the ERCIM Working Group on Constraints (June 2001)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Brinkmann, R., Drechsler, R.: RTL-datapath verification using integer linear programming. In: Proceedings of the IEEE VLSI Design Conference, pp. 741\u2013746 (2002)","DOI":"10.1109\/ASPDAC.2002.995022"},{"key":"4_CR17","unstructured":"Computational infrastructure for operations research, http:\/\/www.coin-or.org"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"5","key":"4_CR19","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.20.5.736","volume":"20","author":"J.J. Forrest","year":"1974","unstructured":"Forrest, J.J., Hirst, J.P.H., Tomlin, J.A.: Practical solution of large scale mixed integer programming problems with UMPIRE. Management Science\u00a020(5), 736\u2013773 (1974)","journal-title":"Management Science"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Operations Research and Management Science, ch. 2, vol.\u00a012, pp. 69\u2013122. Elsevier, Amsterdam (2005)","DOI":"10.1016\/S0927-0507(05)12002-7"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, J.M. (eds.) Combinatorial Analysis, Symposia in Applied Mathematics X, pp. 211\u2013215, Providence, RI, American Mathematical Society (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed logical\/linear programming. Discrete Applied Mathematics\u00a096-97(1), 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR23","unstructured":"ILOG CPLEX. Reference Manual, http:\/\/www.ilog.com\/products\/cplex"},{"key":"4_CR24","unstructured":"International technology roadmap for semiconductors (2005), http:\/\/public.itrs.net"},{"issue":"4","key":"4_CR25","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, I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR26","first-page":"169","volume":"16","author":"E.L. Johnson","year":"1982","unstructured":"Johnson, E.L., Padberg, M.W.: Degree-two inequalities, clique facets, and biperfect graphs. Annals of Discrete Mathematics\u00a016, 169\u2013187 (1982)","journal-title":"Annals of Discrete Mathematics"},{"key":"4_CR27","unstructured":"Klar, A.: Cutting planes in mixed integer programming. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2006)"},{"issue":"2","key":"4_CR28","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A.N. Letchford","year":"2002","unstructured":"Letchford, A.N., Lodi, A.: Strengthening Chv\u00e1tal-Gomory cuts and Gomory fractional cuts. Operations Research Letters\u00a030(2), 74\u201382 (2002)","journal-title":"Operations Research Letters"},{"key":"4_CR29","unstructured":"Marchand, H.: A polyhedral study of the mixed knapsack set and its use to solve mixed integer programs. PhD thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 catholique de Louvain (1998)"},{"key":"4_CR30","first-page":"391","volume":"123\/124","author":"H. Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.A.: Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics\u00a0123\/124, 391\u2013440 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions of Computers\u00a048, 506\u2013521 (1999)","journal-title":"IEEE Transactions of Computers"},{"key":"4_CR32","unstructured":"Mittelmann, H.: Decision tree for optimization software: Benchmarks for optimization software, http:\/\/plato.asu.edu\/bench.html"},{"key":"4_CR33","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)"},{"key":"4_CR34","unstructured":"Opencores, http:\/\/www.opencores.org"},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg, M.W., van Roy, T.J., Wolsey, L.A.: Valid inequalities for fixed charge problems. Operations Research\u00a033(4), 842\u2013861 (1985)","journal-title":"Operations Research"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-48085-3_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"P. Refalo","year":"1999","unstructured":"Refalo, P.: Tight cooperation and its application in piecewise linear optimization. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 375\u2013389. Springer, Heidelberg (1999)"},{"issue":"1","key":"4_CR37","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodosek","year":"1999","unstructured":"Rodosek, R., Wallace, M.G., Hajian, M.T.: A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research\u00a086(1), 63\u201387 (1999)","journal-title":"Annals of Operations Research"},{"key":"4_CR38","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing\u00a06, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","volume":"9","author":"R.M. Stallman","year":"1977","unstructured":"Stallman, R.M., Sussman, G.J.: Forward reasoning and dependency directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence\u00a09, 135\u2013196 (1977)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"4_CR40","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00291-002-0107-1","volume":"24","author":"C. Timpe","year":"2002","unstructured":"Timpe, C.: Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum\u00a024(4), 431\u2013448 (2002)","journal-title":"OR Spectrum"},{"key":"4_CR41","unstructured":"Wolter, K.: Implementation of cutting plane separators for mixed integer programs. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"4_CR42","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"4_CR43","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68155-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T12:49:18Z","timestamp":1708951758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_4","relation":{},"subject":[]}}