{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:21:38Z","timestamp":1767907298630,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642298271","type":"print"},{"value":"9783642298288","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_14","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"211-227","source":"Crossref","is-referenced-by-count":9,"title":["Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Heinz","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T., Berthold, T.: Hybrid Branching. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 309\u2013311. Springer, Heidelberg (2009)"},{"issue":"1","key":"14_CR2","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":"14_CR3","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"14_CR4","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":"14_CR5","unstructured":"Achterberg, T., Brinkmann, R., Wedler, M.: Property checking with constraint integer programming. ZIB-Report 07-37, Zuse Institute Berlin (2007)"},{"key":"14_CR6","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":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1017\/S0269888910000202","volume":"25","author":"R. Bartak","year":"2010","unstructured":"Bartak, R., Salido, M.A., Rossi, F.: New trends on constraint satisfaction, planning, and scheduling: a survey. The Knowledge Engineering Review\u00a025(3), 249\u2013279 (2010)","journal-title":"The Knowledge Engineering Review"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J.C. Beck","year":"2003","unstructured":"Beck, J.C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research\u00a0118, 49\u201371 (2003)","journal-title":"Annals of Operations Research"},{"key":"14_CR9","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)"},{"issue":"1-2","key":"14_CR10","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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-13520-0_34","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Berthold","year":"2010","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Schulz, J.: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 313\u2013317. Springer, Heidelberg (2010)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-02777-2_40","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"T. Berthold","year":"2009","unstructured":"Berthold, T., Heinz, S., Pfetsch, M.E.: Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation? In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 441\u2013446. Springer, Heidelberg (2009)"},{"key":"14_CR13","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. ZIB-Report 09-23, Zuse Institute Berlin (2009)"},{"key":"14_CR14","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 412\u2013417 (1997)"},{"key":"14_CR15","unstructured":"Heinz, S., Beck, J.C.: Solving resource allocation\/scheduling problems with constraint integer programming. In: Salido, M.A., Bart\u00e1k, R., Policella, N. (eds.) Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS 2011), pp. 23\u201330 (2011)"},{"key":"14_CR16","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":"14_CR17","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)"},{"key":"14_CR18","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":"14_CR19","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer (2007)"},{"key":"14_CR20","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"},{"key":"14_CR21","doi-asserted-by":"crossref","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"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T. Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Mathematical Programming Computation\u00a03(2), 103\u2013163 (2011)","journal-title":"Mathematical Programming Computation"},{"issue":"5","key":"14_CR23","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 on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-61310-2_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Martin","year":"1996","unstructured":"Martin, P., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 389\u2013403. Springer, Heidelberg (1996)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Milano, M., Van Hentenryck, P. (eds.): Hybrid Optimization: The Ten Years of CPAIOR. Springer (2010)","DOI":"10.1007\/978-1-4419-1644-0"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Explaining the cumulative propagator. Constraints, 1\u201333 (2010)","DOI":"10.1007\/s10601-010-9103-2"},{"key":"14_CR27","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. thesis, Technische Universit\u00e4t Berlin (1996)"},{"issue":"2","key":"14_CR28","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"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:37:44Z","timestamp":1558298264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}