{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T16:11:58Z","timestamp":1659629518390},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"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":[[2018,1]]},"DOI":"10.1007\/s10601-017-9277-y","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T13:03:40Z","timestamp":1507899820000},"page":"87-122","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How efficient is a global constraint in practice?"],"prefix":"10.1007","volume":"23","author":[{"given":"Sascha Van","family":"Cauwelaert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Lombardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,13]]},"reference":[{"issue":"7","key":"9277_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"9277_CR2","unstructured":"Ait-Kaci, H., & Des Flambertins, F. (1999). Warren\u2019s abstract machine\u2014a tutorial reconstruction (pp. 114). Cambridge: MIT Press Cambridge."},{"issue":"1\u20132","key":"9277_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1\u20132), 119\u2013139.","journal-title":"Constraints"},{"key":"9277_CR4","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. In International Series in Operations Research & Management Science (Vol. 39). Springer, Berlin.","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"12","key":"9277_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical and Computer Modelling"},{"key":"9277_CR6","doi-asserted-by":"crossref","unstructured":"Benhamou, F. (1996). Heterogeneous constraint solving. In International conference on algebraic and logic programming (pp. 62\u201376). Springer, Berlin.","DOI":"10.1007\/3-540-61735-3_4"},{"key":"9277_CR7","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1613\/jair.4199","volume":"50","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cir\u00e9, A.A., & van Hoeve, W.J. (2014). MDD propagation for sequence constraints. Journal of Artificial Intelligence Research (JAIR), 50, 697\u2013722.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9277_CR8","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., & Hooker, J. (2016). Decision diagrams for optimization. Springer International Publishing.","DOI":"10.1007\/978-3-319-42849-9"},{"key":"9277_CR9","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., & Schulz, J. (2011). An approximative criterion for the potential of energetic reasoning. In Theory and practice of algorithms in (computer) systems (pp. 229\u2013239).","DOI":"10.1007\/978-3-642-19754-3_23"},{"key":"9277_CR10","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., & Debruyne, R. (2005). Optimal and suboptimal singleton arc consistency algorithms. In International joint conference on artificial intelligence (pp. 54\u201359).","DOI":"10.1016\/j.artint.2005.02.004"},{"key":"9277_CR11","unstructured":"Bessiere, C., & R\u00e9gin, J.C. (1997). Arc consistency for general constraint networks: preliminary results. In International joint conference on artificial intelligence (pp. 398\u2013404). Citeseer."},{"key":"9277_CR12","unstructured":"Bessiere, C., & Van Hentenryck, P. (2003). To be or not to be... a global constraint. In International conference on principles and practice of constraint programming (pp. 789\u2013794). Springer, Berlin."},{"key":"9277_CR13","doi-asserted-by":"crossref","unstructured":"Brand, S., Narodytska, N., Quimper, C., Stuckey, P.J., & Walsh, T. (2007). Encodings of the sequence constraint. In International conference on principles and practice of constraint programming (pp. 210\u2013224).","DOI":"10.1007\/978-3-540-74970-7_17"},{"issue":"2","key":"9277_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"KCK Cheng","year":"2010","unstructured":"Cheng, K.C.K., & Yap, R.H.C. (2010). An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints, 15(2), 265\u2013304.","journal-title":"Constraints"},{"key":"9277_CR15","doi-asserted-by":"crossref","unstructured":"Dejemeppe, C., Van Cauwelaert, S., & Schaus, P. (2015). The unary resource with transition times. In International conference on principles and practice of constraint programming (pp. 89\u2013104). Springer, Berlin.","DOI":"10.1007\/978-3-319-23219-5_7"},{"key":"9277_CR16","doi-asserted-by":"crossref","unstructured":"Deransart, P., Hermenegildo, M.V., & Maluszynski, J. (2000). Analysis and visualization tools for constraint programming: constraint debugging. In Lecture Notes in Computer Science (Vol. 1870). Springer, Berlin.","DOI":"10.1007\/10722311"},{"key":"9277_CR17","doi-asserted-by":"crossref","unstructured":"Derrien, A., & Petit, T. (2014). A new characterization of relevant intervals for energetic reasoning. In International conference on principles and practice of constraint programming (pp. 289\u2013297). Springer, Berlin.","DOI":"10.1007\/978-3-319-10428-7_22"},{"issue":"1","key":"9277_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M Dincbas","year":"1990","unstructured":"Dincbas, M., Simonis, H., & Van Hentenryck, P. (1990). Solving large combinatorial problems in logic programming. The Journal of Logic Programming, 8 (1), 75\u201393.","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"9277_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., & Mor\u00e9, J.J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213.","journal-title":"Mathematical Programming"},{"key":"9277_CR20","doi-asserted-by":"crossref","unstructured":"Du Boisberranger, J., Gardy, D., Lorca, X., & Truchet, C. (2013). When is it worthwhile to propagate a constraint? A probabilistic analysis of alldifferent. In Workshop on analytic algorithmics and combinatorics (pp. 80\u201390). SIAM.","DOI":"10.1137\/1.9781611973037.10"},{"key":"9277_CR21","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":"9277_CR22","unstructured":"Erschler, J., & Lopez, P. (1990). Energy-based approach for task scheduling under time and resources constraints. In International workshop on project management and scheduling (pp. 115\u2013121)."},{"key":"9277_CR23","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":"9277_CR24","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":"9277_CR25","doi-asserted-by":"crossref","unstructured":"Gay, S., Hartert, R., & Schaus, P. (2015). Simple and scalable time-table filtering for the cumulative constraint. In International conference on principles and practice of constraint programming (pp. 149\u2013157). Springer, Berlin.","DOI":"10.1007\/978-3-319-23219-5_11"},{"key":"9277_CR26","doi-asserted-by":"crossref","unstructured":"Gay, S., Hartert, R., & Schaus, P. (2015). Time-table disjunctive reasoning for the cumulative constraint. In International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming (pp. 157\u2013172). Springer, Berlin.","DOI":"10.1007\/978-3-319-18008-3_11"},{"key":"9277_CR27","unstructured":"Harvey, W.D., & Ginsberg, M.L. (1995). Limited discrepancy search. In International joint conference on artificial intelligence (pp. 607\u2013615)."},{"key":"9277_CR28","doi-asserted-by":"crossref","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L., & Sabharwal, A. (2006). Revisiting the sequence constraint. In International conference on principles and practice of constraint programming (pp. 620\u2013634).","DOI":"10.1007\/11889205_44"},{"issue":"16\u201317","key":"9277_CR29","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1016\/j.artint.2010.07.001","volume":"174","author":"C Jefferson","year":"2010","unstructured":"Jefferson, C., Moore, N.C., Nightingale, P., & Petrie, K.E. (2010). Implementing logical connectives in constraint programming. Artificial Intelligence, 174(16\u201317), 1407\u20131429.","journal-title":"Artificial Intelligence"},{"key":"9277_CR30","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Schwindt, C., & Sprecher, A. (1999). Benchmark instances for project scheduling problems. In Project scheduling (pp. 197\u2013212). Springer, Berlin.","DOI":"10.1007\/978-1-4615-5533-9_9"},{"key":"9277_CR31","unstructured":"Langevine, L., Deransart, P., & Ducass\u00e9, M. (2003). A generic trace schema for the portability of CP(FD) debugging tools. In International workshop on constraint solving and constraint logic programming (pp. 171\u2013195). Springer, Berlin."},{"key":"9277_CR32","unstructured":"Le Pape, C., Couronn\u00e9, P., Vergamini, D., & Gosselin, V. (1994). Time-versus-capacity compromises in project scheduling. In Workshop of the UK planning and scheduling. Citeseer."},{"key":"9277_CR33","doi-asserted-by":"crossref","unstructured":"Letort, A., Beldiceanu, N., & Carlsson, M. (2012). A scalable sweep algorithm for the cumulative constraint. In International conference on principles and practice of constraint programming (pp. 439\u2013454). Springer, Berlin.","DOI":"10.1007\/978-3-642-33558-7_33"},{"key":"9277_CR34","unstructured":"L\u00f3pez-Ortiz, A., Quimper, C.G., Tromp, J., & Van Beek, P. (2003). A fast and simple algorithm for bounds consistency of the alldifferent constraint. In International joint conference on artificial intelligence (Vol. 3, pp. 245\u2013250)."},{"key":"9277_CR35","doi-asserted-by":"crossref","unstructured":"McCreesh, C., & Prosser, P. (2015). A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In International conference on principles and practice of constraint programming (pp. 295\u2013312). Springer, Berlin.","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"9277_CR36","unstructured":"M\u00fcller, T., & W\u00fcrtz, J. (1995). Constructive disjunction in oz. In Workshop Logische Programmierung. Citeseer."},{"key":"9277_CR37","unstructured":"OscaR Team: OscaR: Scala in OR (2012). Available from https:\/\/bitbucket.org\/oscarlib\/oscar ."},{"key":"9277_CR38","doi-asserted-by":"crossref","unstructured":"Pelsser, F., Schaus, P., & R\u00e9gin, J.C. (2013). Revisiting the cardinality reasoning for binpacking constraint. In International conference on principles and practice of constraint programming (pp. 578\u2013586). Springer, Berlin.","DOI":"10.1007\/978-3-642-40627-0_43"},{"key":"9277_CR39","doi-asserted-by":"crossref","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In Handbook of metaheuristics (pp. 399\u2013419). Springer, Berlin.","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"9277_CR40","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":"4","key":"9277_CR41","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). Tsplib\u2014a traveling salesman problem library. ORSA Journal on Computing, 3(4), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"9277_CR42","unstructured":"Schaus, P. (2009). Solving balancing and bin-packing problems with constraint programming. Ph.D. thesis, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve."},{"key":"9277_CR43","unstructured":"Schulte, C. (1997). Oz explorer: a visual constraint programming tool. In L. Naish (Ed.), Proceedings of the fourteenth international conference on logic programming (pp. 286\u2013300). Leuven: The MIT Press."},{"key":"9277_CR44","unstructured":"Schulte, C. (1999). Comparing trailing and copying for constraint programming. In International conference on logic programming (Vol. 99, pp. 275\u2013289)."},{"issue":"3","key":"9277_CR45","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C Schulte","year":"2005","unstructured":"Schulte, C., & Stuckey, P.J. (2005). When do bounds and domain propagation lead to the same search space? ACM Transactions on Programming Languages and Systems, 27(3), 388\u2013425.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9277_CR46","doi-asserted-by":"crossref","unstructured":"Schulte, C., & Tack, G. (2009). Weakly monotonic propagators. In International conference on principles and practice of constraint programming (pp. 723\u2013730). Springer, Berlin.","DOI":"10.1007\/978-3-642-04244-7_56"},{"key":"9277_CR47","doi-asserted-by":"crossref","unstructured":"Shaw, P. (2004). A constraint for bin packing. In International conference on principles and practice of constraint programming (pp. 648\u2013662). Springer, Berlin.","DOI":"10.1007\/978-3-540-30201-8_47"},{"key":"9277_CR48","unstructured":"Shishmarev, M., Mears, C., Tack, G, & de la Banda, M.G. (2015). Visual search tree profiling. In International conference on principles and practice of constraint programming. Springer, Berlin."},{"key":"9277_CR49","doi-asserted-by":"crossref","unstructured":"Shishmarev, M., Mears, C., Tack, G, & de la Banda, M.G. (2016). Learning from learning solvers. In International conference on principles and practice of constraint programming (pp. 455\u2013472). Springer, Berlin.","DOI":"10.1007\/978-3-319-44953-1_29"},{"issue":"1","key":"9277_CR50","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10601-015-9202-1","volume":"21","author":"M Shishmarev","year":"2016","unstructured":"Shishmarev, M., Mears, C., Tack, G, & de la Banda, M.G. (2016). Visual search tree profiling. Constraints, 21(1), 77\u201394.","journal-title":"Constraints"},{"key":"9277_CR51","doi-asserted-by":"crossref","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., & Carlsson, M. (2010). A generic visualization platform for CP. In International conference on principles and practice of constraint programming (pp. 460\u2013474). Springer, Berlin.","DOI":"10.1007\/978-3-642-15396-9_37"},{"key":"9277_CR52","unstructured":"Smith, B.M. (2005). Modelling for constraint programming. In Lecture notes for the first international summer school on constraint programming."},{"key":"9277_CR53","unstructured":"Tack, G. (2009). Constraint propagation\u2014models, techniques, implementation. Ph.D. thesis, Saarland University, Germany."},{"key":"9277_CR54","doi-asserted-by":"crossref","unstructured":"Van Beek, P. (2006). Backtracking search algorithms. In Handbook of constraint programming (pp. 85\u2013134).","DOI":"10.1016\/S1574-6526(06)80008-8"},{"key":"9277_CR55","unstructured":"Van Cauwelaert, S., Lombardi, M., & Pierre, S. (2014). Supervised learning to control energetic reasoning: feasibility study. In Proceedings of the doctoral program of CP2014."},{"key":"9277_CR56","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 (AI) and operations research (OR) techniques in constraint programming (pp. 427\u2013436). Springer, Berlin.","DOI":"10.1007\/978-3-319-18008-3_29"},{"key":"9277_CR57","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2016). A visual web tool to perform what-if analysis of optimization approaches. Tech. rep., UCLouvain."},{"key":"9277_CR58","unstructured":"Van Hentenryck, P., & Dincbas, M. (1987). Forward checking in logic programming. In International conference on logic programming (pp. 229\u2013256)."},{"key":"9277_CR59","unstructured":"Vil\u0131m, P. (2007). Global constraints in scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Praha 1."},{"key":"9277_CR60","volume-title":"An abstract Prolog instruction set (Vol. 309)","author":"D Warren","year":"1983","unstructured":"Warren, D. (1983). An abstract Prolog instruction set (Vol. 309). Menlo Park: SRI International."},{"key":"9277_CR61","doi-asserted-by":"crossref","unstructured":"W\u00fcrtz, J., & M\u00fcller, T. (1996). Constructive disjunction revisited. In G\u00f6rz, G., & H\u00f6lldobler, S. (Eds.) KI-96: Advances in artificial intelligence. KI 1996. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), (Vol. 1137, pp. 377386). Berlin: Springer.","DOI":"10.1007\/3-540-61708-6_78"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9277-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-9277-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9277-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T15:37:29Z","timestamp":1659627449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9277-y"}},"subtitle":["A fair experimental framework"],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9277"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9277-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,13]]}}}