{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:02:39Z","timestamp":1780632159199,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T00:00:00Z","timestamp":1429574400000},"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":[[2015,7]]},"DOI":"10.1007\/s10601-015-9191-0","type":"journal-article","created":{"date-parts":[[2015,4,20]],"date-time":"2015-04-20T04:39:50Z","timestamp":1429504790000},"page":"362-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["New filtering for AtMostNValue and its weighted variant: A Lagrangian approach"],"prefix":"10.1007","volume":"20","author":[{"given":"Hadrien","family":"Cambazard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Guillaume","family":"Fages","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,21]]},"reference":[{"key":"9191_CR1","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2001, volume 2239 of Lecture Notes in Computer Science, (pp. 211\u2013224)","author":"N Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., & Carlsson, M. (2001). Pruning for the minimum constraint family and for the number of distinct values constraint family. In Walsh, T. (Ed.) Principles and Practice of Constraint Programming \u2013 CP 2001, volume 2239 of Lecture Notes in Computer Science, (pp. 211\u2013224). Berlin Heidelberg: Springer."},{"key":"9191_CR2","unstructured":"Beldiceanu, N., Carlsson, M., & Thiel, S. (2002). Cost-filtering algorithms for the two sides of the sum of weights of distinct values constraint. Technical report \u2013 T2002-14: Swedish Institute of Computer Science."},{"issue":"3","key":"9191_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol, P., Van Hoeve, W.J., R\u00e9gin, J.-C., Rousseau, L.-M., & Rueher, M. (2012). Improved filtering for weighted circuit constraints. Constraints, 17(3), 205\u2013233.","journal-title":"Constraints"},{"issue":"4","key":"9191_CR4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10601-006-9001-9","volume":"11","author":"C Bessiere","year":"2006","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., & Walsh, T. (2006). Filtering algorithms for the nvalue constraint. Constraints, 11(4), 271\u2013293.","journal-title":"Constraints"},{"key":"9191_CR5","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010, volume 6308 of Lecture Notes in Computer Science, (pp. 114\u2013128)","author":"C Bessiere","year":"2010","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.-G., & Walsh, T. (2010). Decomposition of the nvalue constraint In Cohen, D. (Ed.) Principles and Practice of Constraint Programming \u2013 CP 2010, volume 6308 of Lecture Notes in Computer Science, (pp. 114\u2013128). Berlin Heidelberg: Springer."},{"key":"9191_CR6","unstructured":"Cambazard, H. Np-hard contraints involving costs: examples of applications and filtering. In Dixi\u00e8mes Journ\u00e9es Francophones de Programmation par Contraintes \u2013 JFPC. 2014. Expos\u00e9 invit\u00e9."},{"issue":"1\u20132","key":"9191_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.dam.2011.09.008","volume":"160","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., O\u2019Mahony, E., & O\u2019Sullivan, B. (2012). A shortest path-based approach to the multileaf collimator sequencing problem. Discrete Applied Mathematics, 160(1\u20132), 81\u201399.","journal-title":"Discrete Applied Mathematics"},{"key":"9191_CR8","unstructured":"Cambazard, H., & Penz, B. (2012). A constraint programming approach for the traveling purchaser problem. In Milano, M. (Ed.) Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Qu\u0117bec City, QC, Canada, October 8-12, 2012. Proceedings, volume 7514 of Lecture Notes in Computer Science, (pp. 735\u2013749): Springer."},{"issue":"7\u20138","key":"9191_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"MC Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., & Werner, T. (2010). Soft arc consistency revisited. Artificial Intelligence, 174(7\u20138), 449\u2013478.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9191_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Van den Bergh","year":"2013","unstructured":"Van den Bergh, J., Belie\u00ebn, J., De Bruecker, P., Demeulemeester, E., & De Boeck, L. (2013). Personnel scheduling: a literature review. European Journal of Operational Research, 226(3), 367\u2013385.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"9191_CR11","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research, 26(6), 992\u20131009.","journal-title":"Operations Research"},{"issue":"0","key":"9191_CR12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.artint.2014.04.001","volume":"212","author":"J-G Fages","year":"2014","unstructured":"Fages, J.-G., & Lap\u00e8gue, T. (2014). Filtering atmostnvalue with difference constraints: application to the shift minimisation personnel task scheduling problem. Artificial Intelligence, 212(0), 116\u2013133.","journal-title":"Artificial Intelligence"},{"key":"9191_CR13","doi-asserted-by":"crossref","unstructured":"Fages, J.-G., Lorca, X., & Rousseau, L.-M. (2014). The salesman and the tree: the importance of search in CP. Constraints, 1\u201318.","DOI":"10.1007\/s10601-014-9178-2"},{"key":"9191_CR14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999, volume 1713 of Lecture Notes in Computer Science, (pp. 189\u2013203)","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering In Jaffar, J. (Ed.) Principles and Practice of Constraint Programming \u2013 CP\u201999, volume 1713 of Lecture Notes in Computer Science, (pp. 189\u2013203). Berlin Heidelberg: Springer."},{"key":"9191_CR15","doi-asserted-by":"crossref","unstructured":"Fontaine, D., Michel, L.D., & Van Hentenryck, P. Constraint-based lagrangian relaxation. In O\u2019Sullivan, B. (Ed.) Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, volume 8656 of Lecture Notes in Computer Science, (pp. 324\u2013339) (p. 2014). Berlin: Springer.","DOI":"10.1007\/978-3-319-10428-7_25"},{"key":"9191_CR16","unstructured":"Gaspers, S., & Szeider, S. (2011). Kernels for global constraints, CoRR. arXiv: 1104.2541 ."},{"key":"9191_CR17","volume-title":"Approaches to integer programming, volume 2 of mathematical programming studies, (pp. 82\u2013114)","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M. (1974). Lagrangean relaxation for integer programming. In Balinski, M.L. (Ed.) Approaches to integer programming, volume 2 of mathematical programming studies, (pp. 82\u2013114). Berlin Heidelberg: Springer."},{"issue":"1","key":"9191_CR18","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., & Karp, R.M. (1971). The traveling-salesman problem and minimum spanning trees: part II. Mathematical Programming, 1(1), 6\u201325.","journal-title":"Mathematical Programming"},{"key":"9191_CR19","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., & Tierney, K. (2010). ISAC - instance-specific algorithm configuration. In ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, (pp. 751\u2013756): IOS Press."},{"issue":"1","key":"9191_CR20","first-page":"257","volume":"43","author":"JHM Lee","year":"2012","unstructured":"Lee, J.H.M., & Leung, K.L. (2012). Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction. Journal of Artificial Intelligence Research, 43(1), 257\u2013292.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9191_CR21","doi-asserted-by":"crossref","unstructured":"Menana, J., & Demassey, S. (2009). Sequencing and counting with the multicost-regular constraint. In Van Hoeve, W.J., & Hooker, J.N. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27-31, 2009, Proceedings, volume 5547 of Lecture Notes in Computer Science, (pp. 178\u2013192): Springer.","DOI":"10.1007\/978-3-642-01929-6_14"},{"issue":"4","key":"9191_CR22","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1287\/opre.25.4.709","volume":"25","author":"SC Narula","year":"1977","unstructured":"Narula, S.C., Ogbu, U.I., & Samuelsson, H.M. (1977). An algorithm for the p-median problem. Operations Research, 25(4), 709\u2013713.","journal-title":"Operations Research"},{"key":"9191_CR23","unstructured":"Prud\u2019homme, C., Fages, J.-G., & Lorca, X. (2014). Choco3 Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S."},{"key":"9191_CR24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004, volume 3258 of Lecture Notes in Computer Science, (pp. 634\u2013647)","author":"M Sellmann","year":"2004","unstructured":"Sellmann, M. (2004). Theoretical foundations of cp-based lagrangian relaxation. In Wallace, M. (Ed.) Principles and Practice of Constraint Programming \u2013 CP 2004, volume 3258 of Lecture Notes in Computer Science, (pp. 634\u2013647). Berlin Heidelberg: Springer."},{"issue":"1\u20134","key":"9191_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M Sellmann","year":"2003","unstructured":"Sellmann, M., & Fahle, T. (2003). Constraint programming based lagrangian relaxation for the automatic recording problem. Annals OR, 118(1\u20134), 17\u201333.","journal-title":"Annals OR"},{"key":"9191_CR26","doi-asserted-by":"crossref","unstructured":"Slusky, M.R., & Van Hoeve, W.J. (2013). A lagrangian relaxation for golomb rulers. In Gomes, C.P., & Sellmann, M. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings, volume 7874 of Lecture Notes in Computer Science, (pp. 251\u2013267): Springer.","DOI":"10.1007\/978-3-642-38171-3_17"},{"key":"9191_CR27","doi-asserted-by":"crossref","unstructured":"Wah, B.W., & Wu, Z. (1999). The theory of discrete lagrange multipliers for nonlinear discrete optimization. In Jaffar, J. (Ed.) Principles and Practice of Constraint Programming - CP\u201999, 5th International Conference, Alexandria, Virginia, USA, October 11-14, 1999, Proceedings, volume 1713 of Lecture Notes in Computer Science, (pp. 28\u201342): Springer.","DOI":"10.1007\/978-3-540-48085-3_3"},{"key":"9191_CR28","volume-title":"Integer programming. Wiley-Interscience series in discrete mathmatics and optimization","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A. (1998). Integer programming. Wiley-Interscience series in discrete mathmatics and optimization. New York: Wiley."},{"issue":"2","key":"9191_CR29","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1014839227049","volume":"113","author":"X Zhao","year":"2002","unstructured":"Zhao, X., & Luh, P.B. (2002). New bundle methods for solving lagrangian relaxation dual problems. Journal of Optimization Theory and Applications, 113(2), 373\u2013397.","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9191-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9191-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9191-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T19:58:42Z","timestamp":1566590322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9191-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,21]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9191"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9191-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,21]]}}}