{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:20:08Z","timestamp":1767914408407,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642381706","type":"print"},{"value":"9783642381713","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_2","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"12-27","source":"Crossref","is-referenced-by-count":15,"title":["Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Heinz","sequence":"first","affiliation":[]},{"given":"Wen-Yang","family":"Ku","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-29828-8_14","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"S. Heinz","year":"2012","unstructured":"Heinz, S., Beck, J.C.: Reconsidering mixed integer programming and MIP-based hybrids for scheduling. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 211\u2013227. Springer, Heidelberg (2012)"},{"key":"2_CR2","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer (2007)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15396-9_10","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"J.C. Beck","year":"2010","unstructured":"Beck, J.C.: Checking-up on branch-and-check. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 84\u201398. Springer, Heidelberg (2010)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics\u00a01, 33\u201342 (1995)","journal-title":"Journal of Heuristics"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.N. Hooker","year":"2005","unstructured":"Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 314\u2013327. Springer, Heidelberg (2005)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J.N. Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Operations Research\u00a055, 588\u2013602 (2007)","journal-title":"Operations Research"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.1090.0733","volume":"58","author":"T.H. Yunes","year":"2010","unstructured":"Yunes, T.H., Aron, I.D., Hooker, J.N.: An integrated solver for optimization problems. Operations Research\u00a058(2), 342\u2013356 (2010)","journal-title":"Operations Research"},{"key":"2_CR10","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: Solving Constraint Integer Programs. Mathematical Programming Computation\u00a01(1), 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"2_CR12","unstructured":"Heinz, S., Schulz, J., Beck, J.C.: Using dual presolving reductions to reformulate cumulative constraints. ZIB-Report 12-37, Zuse Institute Berlin (2012)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-Based Scheduling. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"1-2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0004-3702(00)00035-7","volume":"121","author":"J.C. Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Constraint directed techniques for scheduling with alternative activities. Artificial Intelligence\u00a0121(1-2), 211\u2013250 (2000)","journal-title":"Artificial Intelligence"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-20662-7_34","volume-title":"Experimental Algorithms","author":"S. Heinz","year":"2011","unstructured":"Heinz, S., Schulz, J.: Explanations for the cumulative constraint: An experimental study. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 400\u2013409. Springer, Heidelberg (2011)"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints\u00a016(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Heinz, S., Beck, J.C.: Reconsidering mixed integer programming and MIP-based hybrids for scheduling. ZIB-Report 12-05, Zuse Institute Berlin (2012)","DOI":"10.1007\/978-3-642-29828-8_14"},{"key":"2_CR18","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-68155-7_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2008","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping rectangles. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 21\u201335. Springer, Heidelberg (2008)"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P. Fattahi","year":"2007","unstructured":"Fattahi, P., Saidi Mehrabad, M., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. Journal of Intelligent Manufacturing\u00a018(3), 331\u2013342 (2007)","journal-title":"Journal of Intelligent Manufacturing"}],"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-642-38171-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:08:36Z","timestamp":1609204116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}