{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:25Z","timestamp":1759667905253},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_32","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T21:33:54Z","timestamp":1407879234000},"page":"424-439","source":"Crossref","is-referenced-by-count":4,"title":["CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem"],"prefix":"10.1007","author":[{"given":"Wen-Yang","family":"Ku","sequence":"first","affiliation":[]},{"given":"Thiago","family":"Pinheiro","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11564751_35","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Pesant","year":"2005","unstructured":"Pesant, G., R\u00e9gin, J.-C.: Spread: A balancing constraint based on statistics. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 460\u2013474. Springer, Heidelberg (2005)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-01929-6_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Schaus","year":"2009","unstructured":"Schaus, P., Van Hentenryck, P., R\u00e9gin, J.C.: Scalable load balancing in nurse to patient assignment problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 248\u2013262. Springer, Heidelberg (2009)"},{"key":"32_CR3","unstructured":"Schaus, P., R\u00e9gin, J.C.: Bound-consistent spread constraint. EURO Journal on Computational Optimization, 1\u201324 (2013)"},{"key":"32_CR4","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"32_CR5","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\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"32_CR6","series-title":"Wiley Encyclopedia of Operations Research and Management Science","volume-title":"Minlp solver software","author":"M.R. Bussieck","year":"2010","unstructured":"Bussieck, M.R., Vigerske, S.: Minlp solver software. Wiley Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2010)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D., Wolter, K.: MIPLIB 2010. In: Mathematical Programming Computation, pp. 1\u201361 (2011)","DOI":"10.1007\/s12532-011-0025-9"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Mixed-Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol.\u00a0154, pp. 427\u2013445. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_15"},{"key":"32_CR9","unstructured":"Schaus, P., Deville, Y., Dupont, P., R\u00e9gin, J.C.: Simplification and extension of the spread constraint. In: Third International Workshop on Constraint Propagation and Implementation, pp. 77\u201391 (2006)"},{"key":"32_CR10","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)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1057\/palgrave\/jors\/2601265","volume":"53","author":"C. Mullinax","year":"2002","unstructured":"Mullinax, C., Lawley, M.: Assigning patients to nurses in neonatal intensive care. Journal of the Operational Research Society\u00a053, 25\u201335 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-45193-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C.G. Quimper","year":"2003","unstructured":"Quimper, C.G., Van Beek, P., L\u00f3pez-Ortiz, A., Golynski, A., Sadjad, S.B.: An efficient bounds consistency algorithm for the global cardinality constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 600\u2013614. Springer, Heidelberg (2003)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M. Milano","year":"2002","unstructured":"Milano, M., Ottosson, G., Refalo, P., Thorsteinsson, E.S.: The role of integer programming techniques in constraint programming\u2019s global constraints. INFORMS Journal on Computing\u00a014, 387\u2013402 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Integrated Methods for Optimization, 2nd edn. Springer (2012)","DOI":"10.1007\/978-1-4614-1900-6"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H. Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics\u00a0123, 397\u2013446 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1137\/060660680","volume":"31","author":"X.W. Chang","year":"2009","unstructured":"Chang, X.W., Golub, G.H.: Solving ellipsoid-constrained integer least squares problems. SIAM Journal on Matrix Analysis and Applications\u00a031, 1071\u20131089 (2009)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-07046-9_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"W.Y. Ku","year":"2014","unstructured":"Ku, W.Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for binary quadratic programming problems. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol.\u00a08451, pp. 334\u2013350. Springer, Heidelberg (2014)"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013314 (1980)","journal-title":"Artificial Intelligence"},{"key":"32_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11402763_4","volume-title":"Recent Advances in Constraints","author":"J.C. Beck","year":"2005","unstructured":"Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol.\u00a03419, pp. 41\u201355. Springer, Heidelberg (2005)"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.cor.2010.10.025","volume":"38","author":"J. Pryor","year":"2011","unstructured":"Pryor, J., Chinneck, J.W.: Faster integer-feasibility in mixed-integer linear programs by branching to force change. Computers and Operations Research\u00a038, 1143\u20131152 (2011)","journal-title":"Computers and Operations Research"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Milano, M. (eds.): Hybrid Optimization: Ten Years of CPAIOR. Springer (2011)","DOI":"10.1007\/978-1-4419-1644-0"},{"key":"32_CR23","unstructured":"Beck, J.C.: Modeling, global constraints, and decomposition. In: Tenth Symposium of Abstraction, Reformulation, and Approximation (2013)"},{"key":"32_CR24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G. Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C.G., Zanarini, A.: Counting-based search: Branching heuristics for constraint satisfaction problems. Journal of Artificial Intelligence Research\u00a043, 173\u2013210 (2012)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"32_CR25","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, 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"32_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-29828-8_4","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D. Bergman","year":"2012","unstructured":"Bergman, D., Hooker, J.N.: Graph coloring facets from all-different systems. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 50\u201365. Springer, Heidelberg (2012)"},{"key":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-38171-3_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Heinz","year":"2013","unstructured":"Heinz, S., Ku, W.Y., Beck, J.C.: Recent improvements using constraint integer programming for resource allocation and scheduling. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 12\u201327. Springer, Heidelberg (2013)"},{"key":"32_CR28","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s10601-012-9136-9","volume":"18","author":"S. Heinz","year":"2013","unstructured":"Heinz, S., Schulz, J., Beck, J.C.: Using dual presolving reductions to reformulate cumulative constraints. Constraints\u00a018, 166\u2013201 (2013)","journal-title":"Constraints"}],"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-319-10428-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:19:43Z","timestamp":1558955983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}