{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:30:09Z","timestamp":1770481809216,"version":"3.49.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T00:00:00Z","timestamp":1256601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s10479-009-0654-9","type":"journal-article","created":{"date-parts":[[2009,10,26]],"date-time":"2009-10-26T20:03:18Z","timestamp":1256587398000},"page":"37-76","source":"Crossref","is-referenced-by-count":35,"title":["Integrating Operations Research in Constraint Programming"],"prefix":"10.1007","volume":"175","author":[{"given":"Michela","family":"Milano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,27]]},"reference":[{"key":"654_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T. (2009). Scip: solving constraint integer programs. Mathematical Programming Computation.","DOI":"10.1007\/s12532-008-0001-1"},{"key":"654_CR2","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T., Koch, T., & Wolter, K. (2008). Constraint integer programming: a new approach to integrate cp and mip. In Proceedings of the intl conference on the integration of AI and OR techniques in constraint programming, 2008, pp. 6\u201320.","DOI":"10.1007\/978-3-540-68155-7_4"},{"key":"654_CR3","unstructured":"Ahmed, S., & Shapiro, A. (2002). The sample average approximation method for stochastic programs with integer recourse. In Optimization on line, 2002."},{"key":"654_CR4","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., & Cook, W. (1999). Tsp-solver concorde. http:\/\/www.keck.caam.rice.edu\/concorde.html ."},{"key":"654_CR5","volume-title":"Constraint logic programming using ECLiPSe","author":"K. R. Apt","year":"2006","unstructured":"Apt, K. R., & Wallace, M. G. (2006). Constraint logic programming using ECLiPSe. Cambridge: Cambridge University Press."},{"key":"654_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/297114.297115","volume":"6","author":"F. Arbab","year":"1998","unstructured":"Arbab, F., & Monfroy, E. (1998). Coordination of heterogeneous distributed cooperative constraint solving. Applied Computing Review, 6, 4\u201317. ACM SIGAPP.","journal-title":"Applied Computing Review"},{"key":"654_CR7","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (1995). Efficient operations research algorithms in constraint-based scheduling. In 1st Joint workshop on artificial intelligence and operational research."},{"key":"654_CR8","volume-title":"Constraint-based scheduling","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2003). Constraint-based scheduling. Dordrecht: Kluwer Academic Publisher."},{"key":"654_CR9","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-46135-3_5","volume-title":"Proc. of the Int. Conference on Principles and Practice of Constraint Programming CP 2002","author":"N. Beldiceanu","year":"2002","unstructured":"Beldiceanu, N., & Carlsson, M. (2002). A new multi-resource cumulatives constraint with negative heights. In LNCS : Vol.\u00a02470. Proc. of the Int. Conference on Principles and Practice of Constraint Programming CP 2002 (pp. 63\u201379). Berlin: Springer."},{"key":"654_CR10","unstructured":"Beldiceanu, N., Bourreau, E., Chan, P., & Rivreau, D. (1997). Partial search strategy in CHIP. In Proceedings of the 2nd international conference on meta-heuristics, 1997."},{"key":"654_CR11","unstructured":"Beldiceanu, N., Carlsson, M., & Rampon, J.-X. (2005). Global constraint catalog (SICS Technical Report T2005:08)."},{"key":"654_CR12","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"654_CR13","unstructured":"Benhamou, F., Granvilliers, L., & Goualard, F. (1999). Interval constraints: results and perspectives. In New Trends in Constraints (pp. 1\u201316)."},{"key":"654_CR14","first-page":"245","volume-title":"Logic programming: formal methods and practical applications","author":"H. Beringer","year":"1995","unstructured":"Beringer, H., & De Backer, B. (1995). Combinatorial problem solving in constraint logic programming with cooperating solvers. In C. Beierle & L. Pl\u00fcmer (Eds.), Logic programming: formal methods and practical applications (pp. 245\u2013272). Amsterdam: North Holland."},{"key":"654_CR15","first-page":"398","volume-title":"Proceedings of the international joint conference on artificial intelligence, IJCAI","author":"C. B\u00e8ssiere","year":"1997","unstructured":"B\u00e8ssiere, C., & R\u00e9gin, J. C. (1997). Arc consistency for general constraint networks: preliminary results. In M. Pollack (Ed.), Proceedings of the international joint conference on artificial intelligence, IJCAI (pp.\u00a0398\u2013404). San Mateo: Morgan Kaufmann."},{"key":"654_CR16","series-title":"LNCS","first-page":"1","volume-title":"Proc. of the international conference in the integration of AI and OR techniques in constraint programming\u2014CPAIOR 2005","author":"T. Bousonville","year":"2005","unstructured":"Bousonville, T., Focacci, F., Le Pape, C., Nuijten, E., Paulin, F., Puget, J. F., Robert, A., & Sadeghin, A. (2005). Integration of rules and optimization in plant powerops. In R. Bartak & M. Milano (Eds.), LNCS : Vol.\u00a03524. Proc. of the international conference in the integration of AI and OR techniques in constraint programming\u2014CPAIOR 2005 (pp.\u00a01\u201315). Berlin: Springer."},{"key":"654_CR17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1995","unstructured":"Carlier, J., & Pinson, E. (1995). An algorithm for solving job shop scheduling. Management Science, 35, 164\u2013176.","journal-title":"Management Science"},{"key":"654_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-61551-2_68","volume-title":"Proc. of the int. conference on principles and practice of constraint programming","author":"B. M. W. Cheng","year":"1996","unstructured":"Cheng, B. M. W., Lee, J. H. M., & Wu, J. C. K. (1996). Speeding up constraint propagation by redundant modeling. In E. C. Freuder (Ed.), LNCS : Vol.\u00a01118. Proc. of the int. conference on principles and practice of constraint programming (pp. 91\u2013103). Berlin: Springer."},{"key":"654_CR19","unstructured":"Choi, C. W., Harvey, W., Ho-Man Lee, J., & Stuckey, P. J. (2004). Finite domain bounds consistency revisited. URL www.citebase.org\/cgi-bin\/citations?id=oai:arXiv.org:cs\/0412021 ."},{"key":"654_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(96)90094-1","volume":"27","author":"P. Codognet","year":"1996","unstructured":"Codognet, P., & Diaz, D. (1996). Compiling constraints in clp(fd). Journal of Logic Programming, 27, 1\u2013199.","journal-title":"Journal of Logic Programming"},{"key":"654_CR21","unstructured":"COIN-OR Foundation (2009). COmputational INfrastructure for Operations Research. http:\/\/www.coin-or.org\/ ."},{"issue":"2","key":"654_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070050092","volume":"86","author":"C. Cordier","year":"1999","unstructured":"Cordier, C., Marchand, H., Laundy, R., & Wolsey, L. A. (1999). BC-Opt: a\u00a0branchand-cut code for mixed integer programs. Mathematical Programming, 86(2), 335\u2013354.","journal-title":"Mathematical Programming"},{"issue":"3","key":"654_CR23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T. G. Crainic","year":"2000","unstructured":"Crainic, T. G., Gendreau, M., & Farvolden, J. M. (2000). A simplex-based tabu search method for capacitated network design. INFORMS Journal of Computing, 12(3), 223\u2013236.","journal-title":"INFORMS Journal of Computing"},{"issue":"3","key":"654_CR24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E. Davis","year":"1987","unstructured":"Davis, E. (1987). Constraint propogation with interval labels. Artificial Intelligence, 32(3), 281\u2013331.","journal-title":"Artificial Intelligence"},{"key":"654_CR25","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/11493853_12","volume-title":"Proc. of the int. conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems\u2014CPAIOR","author":"S. Demassey","year":"2005","unstructured":"Demassey, S., Pesant, G., & Rousseau, L.-M. (2005). Constraint programming based column generation for employee timetabling. In R. Bartak & M. Milano (Eds.), LNCS : Vol.\u00a03524. Proc. of the int. conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems\u2014CPAIOR (pp. 140\u2013154). Berlin: Springer."},{"key":"654_CR26","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/10722311","volume-title":"Analysis and visualisation tools for constraint programming","author":"P. Deransart","year":"2000","unstructured":"Deransart, P., Hermenegildo, M. V., & Maluszynski, J. (2000). In LNCS : Vol.\u00a01870. Analysis and visualisation tools for constraint programming. Berlin: Springer."},{"issue":"4","key":"654_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H. El Sakkout","year":"2000","unstructured":"El Sakkout, H., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4), 359\u2013388.","journal-title":"Constraints"},{"issue":"1","key":"654_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"8","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., Junker, U., Karisch, S. E., Kohl, N., Sellmann, M., & Vaaben, B. (2002). Constraint programming based column generation for crew assignment. Journal of Heuristics, 8(1), 59\u201381.","journal-title":"Journal of Heuristics"},{"key":"654_CR29","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Proceedings of the international conference on principles and practice of constraint programming CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In J. Jaffar (Ed.), LNCS : Vol.\u00a01713. Proceedings of the international conference on principles and practice of constraint programming CP\u201999 (pp. 189\u2013203). Berlin: Springer."},{"key":"654_CR30","volume-title":"Constraint and integer programming\u2014toward a unified methodology, Chap.\u00a09.","author":"F. Focacci","year":"2003","unstructured":"Focacci, F., Laburthe, F., & Lodi, A. (2003). Local search and constraint programming\u2014ls and cp illustrated on a transportation problem. In M. Milano (Ed.), Constraint and integer programming\u2014toward a unified methodology, Chap.\u00a09. Dordrecht: Kluwer Academic Publisher."},{"key":"654_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0004-3702(98)00105-2","volume":"107","author":"E. Freuder","year":"1999","unstructured":"Freuder, E., & R\u00e9gin, J. C. (1999). Using constraint metaknowledge to reduce arc-consistency computation. Artificial Intelligence, 107, 125\u2013148.","journal-title":"Artificial Intelligence"},{"key":"654_CR32","doi-asserted-by":"crossref","unstructured":"Fruhwirth, T. (1998). Theory and practice of constraint handling rules. Journal of Logic Programming\u2014Special Issue on Constraint Logic Programming, 37.","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"654_CR33","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/11493853_17","volume-title":"Proc. of the int. conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems\u2014CPAIOR","author":"B. Gendron","year":"2005","unstructured":"Gendron, B., Lebbah, H., & Pesant, G. (2005). Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. In R. Bartak & M. Milano (Eds.), LNCS : Vol.\u00a03524. Proc. of the int. conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems\u2014CPAIOR (pp. 217\u2013227). Berlin: Springer."},{"key":"654_CR34","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"I. E. Grossmann","year":"2001","unstructured":"Grossmann, I. E., & Jain, V. (2001). Algorithms for hybrid milp\/cp models for a class of optimization problems. INFORMS Journal on Computing, 13, 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"key":"654_CR35","unstructured":"Guret, C., Prins, C., & Sevaux, M. (2002). Application of optimization with Xpress MP. In Dash optimization. ISBN 0-9543503-0-8."},{"key":"654_CR36","unstructured":"Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In C.\u00a0S. Mellish (Ed.), Proceedings of the fourteenth international joint conference on artificial intelligence (IJCAI-95) (Vol. 1, pp. 607\u2013615)."},{"key":"654_CR37","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Proc. of the int. conference on principles and practice of constraint programming\u2014CP 2004","author":"J. N. Hooker","year":"2004","unstructured":"Hooker, J. N. (2004). A hybrid method for planning and scheduling. In M. Wallace (Ed.), LNCS : Vol.\u00a03258. Proc. of the int. conference on principles and practice of constraint programming\u2014CP 2004 (pp. 305\u2013316). Berlin: Springer."},{"key":"654_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Proc. of the int. conference on principles and practice of constraint programming\u2014CP 2005","author":"J. N. Hooker","year":"2005","unstructured":"Hooker, J. N. (2005). Planning and scheduling to minimize tardiness. In P. Van Beek (Ed.), LNCS : Vol.\u00a03709. Proc. of the int. conference on principles and practice of constraint programming\u2014CP 2005 (pp. 314\u2013327). Berlin: Springer."},{"key":"654_CR39","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J. N. Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based benders decomposition. Mathematical Programming, 96, 33\u201360.","journal-title":"Mathematical Programming"},{"key":"654_CR40","unstructured":"ILOG Optimization Team (2003). Concert technology."},{"key":"654_CR41","unstructured":"ILOG Optimization Team (2008). Cplex 11.2 user manual."},{"key":"654_CR42","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. Junger","year":"2000","unstructured":"Junger, M., & Thienel, S. (2000). The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software: Practice and Experience, 30, 1325\u20131352.","journal-title":"Software: Practice and Experience"},{"key":"654_CR43","series-title":"LNCS","first-page":"155","volume-title":"Proc. of the int. conference on principles and practice of constraint programming","author":"O. Kamarainen","year":"2002","unstructured":"Kamarainen, O., & El Sakkout, H. (2002). Local probing applied to scheduling. In P. Van Hentenryck (Ed.), LNCS : Vol.\u00a02470. Proc. of the int. conference on principles and practice of constraint programming (pp.\u00a0155\u2013171). Berlin: Springer."},{"issue":"3\u20134","key":"654_CR44","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1020565317875","volume":"7","author":"F. Laburthe","year":"2002","unstructured":"Laburthe, F., & Caseau, Y. (2002). Salsa: a\u00a0language for search algorithms. Constraints, 7(3\u20134), 255\u2013288.","journal-title":"Constraints"},{"key":"654_CR45","first-page":"7","volume":"1","author":"C. Lamar\u00e9chal","year":"2003","unstructured":"Lamar\u00e9chal, C. (2003). The omnipresence of Lagrange. 4OR, 1, 7\u201325.","journal-title":"4OR"},{"key":"654_CR46","first-page":"145","volume-title":"Proceedings of the 1st international conference on AI planning systems, AIPS","author":"P. Langley","year":"1992","unstructured":"Langley, P. (1992). Systematic and nonsystematic search strategies. In J. Hendler (Ed.), Proceedings of the 1st international conference on AI planning systems, AIPS (pp. 145\u2013152). San Mateo: Morgan Kaufmann."},{"key":"654_CR47","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G., & Louveaux, F. V. (1993). The integer l-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13, 133\u2013142.","journal-title":"Operations Research Letters"},{"key":"654_CR48","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J. L. Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J. L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10, 29\u2013127.","journal-title":"Artificial Intelligence"},{"key":"654_CR49","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(93)90047-K","volume":"16","author":"T. Le Provost","year":"1993","unstructured":"Le Provost, T., & Wallace, M. (1993). Generalized constraint propagation over the clp scheme. Journal of Logic Programming, 16, 319\u2013359.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"654_CR50","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"O. Lhomme","year":"2002","unstructured":"Lhomme, O. & Jussien, N. (2002). Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1), 21\u201345.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"654_CR51","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. (1973). An efficient heuristic for the Traveling Salesman Problem. Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"issue":"5","key":"654_CR52","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J. P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J. P., & Sakallah, K. A. (1999). Grasp-a search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5), 506\u2013521.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"654_CR53","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10601-008-9041-4","volume":"13","author":"K. Marriott","year":"2008","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P. J., Garcia De\u00a0La\u00a0Banda, M., & Wallace, M. (2008). The design of the zinc modelling language. Constraints, 13(3), 229\u2013267.","journal-title":"Constraints"},{"issue":"1\u20132","key":"654_CR54","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L. Michel","year":"2000","unstructured":"Michel, L., & Van Hentenryck, P. (2000). Localizer. Constraints, 5(1\u20132), 43\u201384.","journal-title":"Constraints"},{"issue":"3","key":"654_CR55","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10288-006-0019-z","volume":"4","author":"M. Milano","year":"2005","unstructured":"Milano, M., & Wallace, M. (2005). Integrating operations research in constraint programming. 4OR, 4(3), 175\u2013219.","journal-title":"4OR"},{"issue":"2","key":"654_CR56","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/trsc.1030.0078","volume":"39","author":"A. V. Moura","year":"2005","unstructured":"Moura, A. V., Yunes, T. H., & de Souza, C. C. (2005). Hybrid column generation approaches for urban transit crew management problems. Transportation Science, 39(2), 273\u2013288.","journal-title":"Transportation Science"},{"key":"654_CR57","first-page":"407","volume":"83","author":"V. I. Norkin","year":"1998","unstructured":"Norkin, V. I., Pflug, G. C., & Ruszczynski, A. (1998). A branch and bound method for stochastic global optimization. Mathematical Programming, 83, 407\u2013423.","journal-title":"Mathematical Programming"},{"issue":"6","key":"654_CR58","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797\u2013813.","journal-title":"Management Science"},{"issue":"3","key":"654_CR59","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P. J., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"654_CR60","doi-asserted-by":"crossref","unstructured":"Ouaja, W., & Richards, B. (2005). Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. In Proceedings of 2005 ACM symposium on applied computing (pp. 383\u2013387).","DOI":"10.1145\/1066677.1066766"},{"key":"654_CR61","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Proc. of the int. conference on principles and practice of constraint programming CP2004","author":"L. Perron","year":"2004","unstructured":"Perron, L., Shaw, P., & Furnon, V. (2004). Propagation guided large neighborhood search. In M. Wallace (Ed.), LNCS : Vol.\u00a03258. Proc. of the int. conference on principles and practice of constraint programming CP2004. (pp. 468\u2013481). Berlin: Springer."},{"issue":"3","key":"654_CR62","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"Pesant, G., & Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5(3), 255\u2013279.","journal-title":"Journal of Heuristics"},{"key":"654_CR63","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Stuckey, P. J., Wallace, M., & Brand, S. (2008). From high-level model to branch-and-price solution in g12. In Proceedings of the intl conference on the integration of artificial intelligence and operations research techniques in CP (pp. 218\u2013232).","DOI":"10.1007\/978-3-540-68155-7_18"},{"key":"654_CR64","series-title":"LNCS","volume-title":"Proceedings of the international conference on principle and practice of constraint programming\u2014CP 2000","author":"P. Refalo","year":"2000","unstructured":"Refalo, P. (2000). Linear formulation of constraint programming models and hybrid solvers. In R. Dechter (Ed.), LNCS : Vol.\u00a01894. Proceedings of the international conference on principle and practice of constraint programming\u2014CP 2000. Berlin: Springer."},{"key":"654_CR65","unstructured":"R\u00e9gin, J. C. (1994). A filtering algorithm for constraints of difference in CSPs. In B.\u00a0Hayes-Roth & R. Korf (Eds.), Proceedings of the twelfth national conference on artificial intelligence\u2014AAAI94 (pp. 362\u2013367)."},{"key":"654_CR66","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/978-3-540-48085-3_28","volume-title":"Proceedings of the international conference on principles and practice of constraint programming, CP\u201999","author":"J. C. R\u00e9gin","year":"1999","unstructured":"R\u00e9gin, J. C. (1999). Arc consistency for global cardinality constraints with costs. In J. Jaffar (Ed.), LNCS : Vol.\u00a01713. Proceedings of the international conference on principles and practice of constraint programming, CP\u201999 (pp. 390\u2013404). Berlin: Springer."},{"key":"654_CR67","volume-title":"Constraint and integer programming","author":"J. C. Regin","year":"2004","unstructured":"Regin, J. C. (2004). Global constraints and filtering algorithms. In M. Milano (Ed.), Constraint and integer programming. Dordrecht: Kluwer Academic Publisher."},{"key":"654_CR68","unstructured":"Rodosek, R., Wallace, M., & Hajian, M. T. (1997). A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research. Recent Advances in Combinatorial Optimization."},{"issue":"5","key":"654_CR69","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/spe.4380230507","volume":"23","author":"M. Sannella","year":"1993","unstructured":"Sannella, M., Maloney, J., Freeman-Benson, B., & Borning, A. (1993). Multi-way versus one-way constraints in user interfaces: experience with the DeltaBlue algorithm. Software: Practice and Experience, 23(5), 529\u2013566.","journal-title":"Software: Practice and Experience"},{"issue":"3","key":"654_CR70","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\u00a0bounds 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":"654_CR71","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Proc. of the int. conference on principles and practice of constraint programming CP1998","author":"P. Shaw","year":"1998","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J.\u00a0F. Puget (Eds.), LNCS : Vol.\u00a01520. Proc. of the int. conference on principles and practice of constraint programming CP1998 (pp. 417\u2013431). Berlin: Springer."},{"key":"654_CR72","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"A. Tarim","year":"2006","unstructured":"Tarim, A., Manandhar, S., & Walsh, T. (2006). Stochastic constraint programming: a\u00a0scenario-based approach. Constraints, 11, 53\u201380.","journal-title":"Constraints"},{"key":"654_CR73","volume-title":"The OPL optimization programming language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge: MIT Press."},{"key":"654_CR74","volume-title":"Constraint-based local search","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. Cambridge: MIT Press."},{"key":"654_CR75","unstructured":"van Hoeve, W. J. (2006). The alldifferent constraint: a systematic overview. URL www.cs.cornell.edu\/~vanhoeve\/papers\/alldiff.pdf ."},{"key":"654_CR76","volume-title":"Proc. of the European conference on artificial intelligence, ECAI","author":"T. Walsh","year":"2002","unstructured":"Walsh, T. (2002). Stochastic constraint programming. In F. van\u00a0Harmelen (Ed.), Proc. of the European conference on artificial intelligence, ECAI. Amsterdam: IOS Press."},{"key":"654_CR77","unstructured":"Zhou, N. F. (2005). Finite-domain constraint propagators in action rules. Theory and Practice of Logic Programming (4\u20135)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0654-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0654-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0654-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:57Z","timestamp":1559153277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0654-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,27]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["654"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0654-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,27]]}}}