{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T17:29:58Z","timestamp":1680456598047},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10601-015-9233-7","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T06:12:53Z","timestamp":1448950373000},"page":"495-532","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three generalizations of the FOCUS constraint"],"prefix":"10.1007","volume":"21","author":[{"given":"Nina","family":"Narodytska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,1]]},"reference":[{"key":"9233_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., & Orlin, J.B. (1993). Network flows: Theory, algorithms, and applications."},{"key":"9233_CR2","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., & Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI\u201904) (pp. 482\u2013486)."},{"key":"9233_CR3","unstructured":"Dasgupta, S., Papadimitriou, C.H., & Vazirani, U.V. (2006). Algorithms. McGraw-Hill."},{"key":"9233_CR4","doi-asserted-by":"crossref","unstructured":"De Clercq, A., Petit, T., Beldiceanu, N., & Jussien, N. (2011). Filtering algorithms for discrete cumulative problems with overloads of resource. In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP\u201911) (pp. 240\u2013255).","DOI":"10.1007\/978-3-642-23786-7_20"},{"issue":"4","key":"9233_CR5","doi-asserted-by":"crossref","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. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"key":"9233_CR6","doi-asserted-by":"crossref","unstructured":"Maher, M., Narodytska, N., Quimper, C-G., & Walsh, T. (2008). Flow-based propagators for the sequence and related global constraints. In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP\u201908) (pp. 159\u2013174).","DOI":"10.1007\/978-3-540-85958-1_11"},{"key":"9233_CR7","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP\u201904) (pp. 482\u2013495).","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9233_CR8","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2001). A filtering algorithm for the stretch constraint. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP\u201901) (pp. 183\u2013195).","DOI":"10.1007\/3-540-45578-7_13"},{"key":"9233_CR9","unstructured":"Pesant, G., & Spread, J.-C. R\u00e9gin. (2005). A balancing constraint based on statistics. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP\u201905) (pp. 460\u2013474)."},{"key":"9233_CR10","doi-asserted-by":"crossref","unstructured":"Petit, T., & Poder, E. (2008). Global propagation of practicability constraints. In Proc. CPAIOR, volume 5015 (pp. 361\u2013366).","DOI":"10.1007\/978-3-540-68155-7_38"},{"issue":"4","key":"9233_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1142\/S0218213011000371","volume":"20","author":"T Petit","year":"2011","unstructured":"Petit, T., & R\u00e9gin, J.-C. (2011). The ordered distribute constraint. International Journal on Artificial Intelligence Tools, 20(4), 617\u2013637.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"9233_CR12","doi-asserted-by":"crossref","unstructured":"Petit, T. (2012). Focus: A constraint for concentrating high costs. In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP\u201912).","DOI":"10.1007\/978-3-642-33558-7_42"},{"key":"9233_CR13","unstructured":"R\u00e9gin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on Artificial intelligence (AAAI\u201994) (Vol. 1, pp. 362\u2013367). American Association for Artificial Intelligence."},{"key":"9233_CR14","unstructured":"R\u00e9gin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the 14th National Conference on Artificial intelligence (AAAI\u201998) (pp. 209\u2013215)."},{"key":"9233_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1090\/dimacs\/057\/07","volume":"57","author":"J-C R\u00e9gin","year":"2001","unstructured":"R\u00e9gin, J.-C. (2001). Minimization of the number of breaks in sports scheduling problems using constraint programming. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 57, 115\u2013130.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"9233_CR16","volume-title":"Handbook of constraint programming (Foundations of Artificial Intelligence)","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of constraint programming (Foundations of Artificial Intelligence). New York: Elsevier Science Inc."},{"key":"9233_CR17","doi-asserted-by":"crossref","unstructured":"Schaus, P., Deville, Y., Dupont, P., & R\u00e9gin, J-C. (2007). The deviation constraint. In Proc. CPAIOR (Vol. 4510, pp. 260\u2013274).","DOI":"10.1007\/978-3-540-72397-4_19"},{"key":"9233_CR18","doi-asserted-by":"crossref","unstructured":"Schaus, P., Van Hentenryck, P., & R\u00e9gin, J.-C. (2009). Scalable load balancing in nurse to patient assignment problems. In Proc. CPAIOR, volume 5547 of Lecture Notes in Computer Science (pp. 248\u2013262). Springer.","DOI":"10.1007\/978-3-642-01929-6_19"},{"issue":"4","key":"9233_CR19","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.10.4.518","volume":"10","author":"A Wagner","year":"1962","unstructured":"Wagner, A., & Harvey, M. (1962). Optimal capacity scheduling I. Operations Research, 10(4), 518\u2013532.","journal-title":"Operations Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9233-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9233-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9233-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9233-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:19Z","timestamp":1559243659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9233-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9233"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9233-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}