{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:17Z","timestamp":1725895337307},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_46","type":"book-chapter","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T22:32:47Z","timestamp":1349217167000},"page":"633-646","source":"Crossref","is-referenced-by-count":10,"title":["A Hybrid MIP\/CP Approach for Multi-activity Shift Scheduling"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Salvagnin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving Filtering Algorithms from Constraint Checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 107\u2013122. Springer, Heidelberg (2004)"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-72397-4_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M.-C. C\u00f4t\u00e9","year":"2007","unstructured":"C\u00f4t\u00e9, M.-C., Gendron, B., Rousseau, L.-M.: Modeling the Regular Constraint with Integer Programming. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 29\u201343. Springer, Heidelberg (2007)"},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s10601-009-9083-2","volume":"16","author":"M.C. C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.C., Gendron, B., Quimper, C.G., Rousseau, L.M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints\u00a016(1), 54\u201376 (2011)","journal-title":"Constraints"},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1287\/mnsc.1100.1264","volume":"57","author":"M.C. C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.C., Gendron, B., Rousseau, L.M.: Grammar-based integer programming models for multiactivity shift scheduling. Management Science\u00a057(1), 151\u2013163 (2011)","journal-title":"Management Science"},{"issue":"4","key":"46_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S. Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-32147-4_6","volume-title":"Combinatorial Optimization","author":"M. Fischetti","year":"2012","unstructured":"Fischetti, M., Liberti, L.: Orbital Shrinking. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol.\u00a07422, pp. 48\u201358. Springer, Heidelberg (2012)"},{"key":"46_CR7","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2012), \n                    \n                      http:\/\/www.gecode.org"},{"key":"46_CR8","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer (2006)"},{"issue":"1","key":"46_CR9","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(1), 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"46_CR10","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley (1979)"},{"key":"46_CR11","unstructured":"IBM ILOG: CPLEX 12.2 User\u2019s Manual (2011)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Milano, M.: Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers (2003)","DOI":"10.1007\/978-1-4419-8917-8_1"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-01929-6_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Pesant","year":"2009","unstructured":"Pesant, G., Quimper, C.-G., Rousseau, L.-M., Sellmann, M.: The Polytope of Context-Free Grammar Constraints. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 223\u2013232. Springer, Heidelberg (2009)"},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C.-G. Quimper","year":"2006","unstructured":"Quimper, C.-G., Walsh, T.: Global Grammar Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.-G. Quimper","year":"2007","unstructured":"Quimper, C.-G., Walsh, T.: Decomposing Global Grammar Constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10732-009-9106-6","volume":"16","author":"C.G. Quimper","year":"2010","unstructured":"Quimper, C.G., Rousseau, L.M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics\u00a016, 373\u2013392 (2010)","journal-title":"Journal of Heuristics"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/11889205_38","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M. Sellmann","year":"2006","unstructured":"Sellmann, M.: The Theory of Grammar Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 530\u2013544. Springer, Heidelberg (2006)"},{"key":"46_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M. Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical Foundations of CP-Based Lagrangian Relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 634\u2013647. Springer, Heidelberg (2004)"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Milano, M.: Hybrid Optimization: The Ten Years of CPAIOR. Springer Optimization and Its Applications. Springer (2010)","DOI":"10.1007\/978-1-4419-1644-0"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T23:15:57Z","timestamp":1557270957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}