{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T12:37:45Z","timestamp":1762173465018},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T00:00:00Z","timestamp":1495497600000},"content-version":"unspecified","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":[[2017,10]]},"DOI":"10.1007\/s10601-017-9269-y","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T08:09:32Z","timestamp":1495526972000},"page":"493-511","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient filtering for the Resource-Cost AllDifferent constraint"],"prefix":"10.1007","volume":"22","author":[{"given":"Sascha","family":"Van Cauwelaert","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"9269_CR1","unstructured":"Ait-Kaci, H., & Des Flambertins. F. (1999). Warren\u2019s abstract machine: a tutorial reconstruction."},{"key":"9269_CR2","unstructured":"Applegate, David L., Bixby, Robert E., Chv\u00e1tal, V, & Cook, W. J. (2006). Concorde TSP solver."},{"key":"9269_CR3","unstructured":"Applegate, David L., Bixby, Robert E., Chv\u00e1tal, V, & Cook, W. J. (2011). The traveling salesman problem: a computational study. Princeton University Press."},{"key":"9269_CR4","unstructured":"Van Cauwelaert, S, & Schaus, P. CSPLib problem 075: product matrix travelling salesman problem. http:\/\/www.csplib.org\/Problems\/prob075 ."},{"key":"9269_CR5","unstructured":"de Saint-Marcq, V C, Schaus, P, Solnon, C, & Lecoutre, C (2013). Sparse-sets for domain implementation. In International workshop on techniques foR implementing constraint programming systems (pp. 1\u201310)."},{"key":"9269_CR6","doi-asserted-by":"crossref","unstructured":"Dejemeppe, C, Devolder, O, Lecomte, V, & Schaus, P (2016). Forward-checking filtering for nested cardinality constraints: application to an energy cost-aware production planning problem for tissue manufacturing. In International conference on integration of artificial intelligence and operations research techniques in constraint programming (pp. 108\u2013124). Springer.","DOI":"10.1007\/978-3-319-33954-2_9"},{"issue":"2","key":"9269_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ElizabethD Dolan","year":"2002","unstructured":"Dolan, Elizabeth D., & Mor\u00e9, Jorge J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213.","journal-title":"Mathematical Programming"},{"key":"9269_CR8","doi-asserted-by":"crossref","unstructured":"Ducomman, S, Cambazard, H, & Penz, B (2016). Alternative filtering for the weighted circuit constraint: comparing lower bounds for the TSP and solving TSPTW. In AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v30i1.10434"},{"key":"9269_CR9","unstructured":"Focacci, F, Lodi, A, & Milano, M (1999). Integration of CP and OR methods for matching problems. In International workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems."},{"key":"9269_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S1571-0653(04)00002-2","volume":"1","author":"F Focacci","year":"1999","unstructured":"Focacci, F, Lodi, A, Milano, M, & Vigo, D (1999). Solving TSP through the integration of OR and CP techniques. Electronic Notes in Discrete Mathematics, 1, 13\u201325.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"9269_CR11","doi-asserted-by":"crossref","unstructured":"Gay, S, Hartert, R, Lecoutre, C, & Schaus, P (2015). Conflict ordering search for scheduling problems. In International conference on principles and practice of constraint programming (pp. 140\u2013148). Springer.","DOI":"10.1007\/978-3-319-23219-5_10"},{"key":"9269_CR12","doi-asserted-by":"crossref","unstructured":"Gay, S, Schaus, P, & De Smedt, V (2014). Continuous casting scheduling with constraint programming. In International conference on principles and practice of constraint programming (pp. 831\u2013845). Springer.","DOI":"10.1007\/978-3-319-10428-7_59"},{"key":"9269_CR13","unstructured":"Gilmore, P.C, Lawler, E.L., & Shmoys, D. (1985). Well-solved special cases of the traveling salesman problem. In John Wiley & Sons (ed.), The traveling salesman problem."},{"key":"9269_CR14","doi-asserted-by":"crossref","unstructured":"Houndji, V. R., Schaus, P., Wolsey, L., & Deville, Y. (2014). The stockingcost constraint. In International conference on principles and practice of constraint programming (pp. 382\u2013397). Springer.","DOI":"10.1007\/978-3-319-10428-7_29"},{"issue":"4","key":"9269_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R Jonker","year":"1983","unstructured":"Jonker, R., & Volgenant, T. (1983). Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters, 2(4), 161\u2013163.","journal-title":"Operations Research Letters"},{"key":"9269_CR16","unstructured":"OscaR Team (2012). OscaR: scala in OR. Available from https:\/\/bitbucket.org\/oscarlib\/oscar ."},{"issue":"1","key":"9269_CR17","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G Pesant","year":"1998","unstructured":"Pesant, G, Gendreau, M, Potvin, J.-Y., & Rousseau, J.-M. (1998). An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32(1), 12\u201329.","journal-title":"Transportation Science"},{"issue":"5","key":"9269_CR18","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.35.5.772","volume":"35","author":"RD Plante","year":"1987","unstructured":"Plante, R. D., Lowe, T. J., & Chandrasekaran, R. (1987). The product matrix traveling salesman problem: an application and solution heuristic. Operations Research, 35(5), 772\u2013783.","journal-title":"Operations Research"},{"key":"9269_CR19","unstructured":"R\u00e9gin, J.-C (1994). A filtering algorithm for constraints of difference in CSPs. In AAAI conference on artificial intelligence (Vol. 94, pp. 362\u2013367)."},{"issue":"3-4","key":"9269_CR20","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"J-C R\u00e9gin","year":"2002","unstructured":"R\u00e9gin, J.-C. (2002). Cost-based arc consistency for global cardinality constraints. Constraints, 7(3-4), 387\u2013405.","journal-title":"Constraints"},{"key":"9269_CR21","unstructured":"Sarvanov, V. I. (1980). On the complexity of minimizing a linear form on a set of cyclic permutations. In Dokl. Akad. Nauk SSSR (Vol. 253, pp. 533\u2013535)."},{"key":"9269_CR22","doi-asserted-by":"crossref","unstructured":"Sellmann, M (2002). An arc-consistency algorithm for the minimum weight all different constraint. In International conference on principles and practice of constraint programming (pp. 744\u2013749). Springer.","DOI":"10.1007\/3-540-46135-3_56"},{"key":"9269_CR23","unstructured":"Simonis, H, & Hadzic, T (2010). A family of resource constraints for energy cost aware scheduling. In Third international workshop on constraint reasoning and optimization for computational sustainability. St. Andrews."},{"key":"9269_CR24","doi-asserted-by":"crossref","unstructured":"Simonis, H, & Hadzic, T (2011). A resource cost aware cumulative. In Recent advances in constraints: 14th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2009, Barcelona, Spain, June 15-17, 2009, Revised Selected Papers (pp. 76\u201389). Springer.","DOI":"10.1007\/978-3-642-19486-3_5"},{"key":"9269_CR25","doi-asserted-by":"crossref","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2015). Understanding the potential of propagators. In International conference on integration of artificial intelligence and operations research techniques in constraint programming (pp. 427\u2013436). Springer.","DOI":"10.1007\/978-3-319-18008-3_29"},{"key":"9269_CR26","unstructured":"Van Cauwelaert, S, Lombardi, M, & Schaus, P (2017). A visual web tool to perform what-if analysis of optimization approaches. arXiv preprint arXiv: 1703.06042 ."},{"key":"9269_CR27","unstructured":"Van Hentenryck, P, & Carillon, J.-P. (1988). Generality versus specificity: an experience with AI and OR techniques. In AAAI conference on artificial intelligence (pp. 660\u2013664)."},{"key":"9269_CR28","unstructured":"van Hoeve, W.-J. (2001). The alldifferent constraint: a survey. coRR cs.PL\/0105015."},{"key":"9269_CR29","unstructured":"Vil\u00edm, P. (2004). O ( n . log ( n ) ) $\\mathcal {O}(n.log(n))$ filtering algorithms for unary resource constraint. In R\u00e9gin, J-C, & Rueher, M (Eds.), International conference on integration of artificial intelligence and operations research techniques in constraint programming (pp. 335\u2013347): Springer."},{"key":"9269_CR30","unstructured":"Wamba, G. M., & Beldiceanu, N. (2016). The taskintersection constraint. In International conference on integration of artificial intelligence and operations research techniques in constraint programming (pp. 246\u2013261). Springer."},{"key":"9269_CR31","volume-title":"An abstract Prolog instruction set, Vol. 309","author":"DHD Warren","year":"1983","unstructured":"Warren, D. H. D. (1983). An abstract Prolog instruction set Vol. 309. California: Artificial Intelligence Center, SRI International Menlo Park."},{"issue":"4","key":"9269_CR32","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.ijforecast.2014.08.008","volume":"30","author":"R Weron","year":"2014","unstructured":"Weron, R (2014). Electricity price forecasting: a review of the state-of-the-art with a look into the future. International Journal of Forecasting, 30(4), 1030\u20131081.","journal-title":"International Journal of Forecasting"},{"issue":"13","key":"9269_CR33","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1016\/j.enpol.2004.07.013","volume":"34","author":"R W\u00fcstenhagen","year":"2006","unstructured":"W\u00fcstenhagen, R, & Bilharz, M (2006). Green energy market development in Germany: effective public policy and emerging customer demand. Energy Policy, 34 (13), 1681\u20131696.","journal-title":"Energy Policy"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9269-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9269-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9269-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T17:57:29Z","timestamp":1692813449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9269-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,23]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9269"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9269-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,23]]}}}