{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:47Z","timestamp":1725559247009},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261520"},{"type":"electronic","value":"9783540322641"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_20","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T07:35:25Z","timestamp":1279092925000},"page":"258-272","source":"Crossref","is-referenced-by-count":8,"title":["Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs"],"prefix":"10.1007","author":[{"given":"Mohand Ou Idir","family":"Khemmoudj","sequence":"first","affiliation":[]},{"given":"Hachemi","family":"Bennaceur","sequence":"additional","affiliation":[]},{"given":"Anass","family":"Nagih","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Affane, M.S., Bennaceur, H.: A Weighted Arc Consistency Technique for MAX-CSP. In: ECAI, pp. 209\u2013213 (1998)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/3-540-46135-3_40","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"T. Benoist","year":"2002","unstructured":"Benoist, T., Gaudin, E., Rottembourg, B.: Constraint Programming Contribution to Benders Decomposition: A Case Study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 603\u2013617. Springer, Heidelberg (2002)"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","volume":"65","author":"C. Bessi\u00e8re","year":"1994","unstructured":"Bessi\u00e8re, C., Cordier, M.: Arc-consistency and Arc-consistency Again. Artificial Intelligence\u00a065(1), 179\u2013190 (1994)","journal-title":"Artificial Intelligence"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"Camerini, P.M., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. Mathematical programming Study\u00a03, 26\u201334 (1975)","journal-title":"Mathematical programming Study"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/ijoc.10.3.276","volume":"10","author":"K. Darby-Dowman","year":"1998","unstructured":"Darby-Dowman, K., Little, J.: Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal on Computing\u00a010(3), 276\u2013286 (1998)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF00137871","volume":"1","author":"K. Darby-Dowman","year":"1997","unstructured":"Darby-Dowman, K., Little, J., Mitra, G., Zaffalon, M.: Constraint Logic Programming and Integer Programming Approaches and their Collaboration in Solving an Assignment Scheduling Problem. Constraints, An International Journal\u00a01(3), 245\u2013264 (1997)","journal-title":"Constraints, An International Journal"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R. Dechter","year":"1994","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence\u00a068, 211\u2013241 (1994)","journal-title":"Artificial Intelligence"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-Based Domain Filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"issue":"3-4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Optimization-Oriented Global Constraints. Constraints\u00a07(3-4), 351\u2013365 (2002)","journal-title":"Constraints"},{"key":"20_CR10","unstructured":"Frost, D., Dechter, R.: In search of the best constraint satisfaction search. In: Proceedings AAAI 1994, Seatlle WA, pp. 301\u2013306 (1994)"},{"key":"20_CR11","first-page":"82","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: The Lagrangean Relaxation for Integer Programming. Mathematical Programming\u00a02, 82\u2013114 (1974)","journal-title":"Mathematical Programming"},{"issue":"1-3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed Logical\/Linear Programming. Discrete Applied Mathematics\u00a096-97(1-3), 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1017\/S0269888900001077","volume":"15","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N., Ottosson, G., Thornsteinsson, E.S., Kim, H.-J.: A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review\u00a015, 11\u201330 (2000)","journal-title":"Knowledge Engineering Review"},{"key":"20_CR14","unstructured":"Koster, A.M.C.: Frequency Assignment Problem, Models and Algorithms. Proefschrift Universiteit Maastricht. (1999)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ro:2003014","volume":"37","author":"N. Maculan","year":"2003","unstructured":"Maculan, N., Passini, M.M., Brito, J.A.M., Loiseau, I.: Column-Generation in Integer Linear Programming. RAIRO - Operations Research\u00a037, 67\u201383 (2003)","journal-title":"RAIRO - Operations Research"},{"key":"20_CR17","volume-title":"Proceedings of the Seventeenth National Conference on Artificial Intelligence","author":"M. Milano","year":"2000","unstructured":"Milano, M., Ottosson, G., Refalo, P., Erlendur, S.: The Benefits of Global Constraints for the Integration of Constraint Programming and Integer Programming. In: Thorsteinsson, E.S. (ed.) Proceedings of the Seventeenth National Conference on Artificial Intelligence. AAAI, Menlo Park (2000)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.: Arc and Path consistency revisited. Artificial Intelligence\u00a028, 225\u2013233 (1986)","journal-title":"Artificial Intelligence"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M. Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical Foundations of CP-based Lagrangian Relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 634\u2013647. Springer, Heidelberg (2004)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1014839227049","volume":"113","author":"X. Zhao","year":"2002","unstructured":"Zhao, X., Luh, P.B.: New bundle methods for solving Lagrangian relaxation dual problems. Journal of Optimization Theory and Applications\u00a0113(2), 373\u2013397 (2002)","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493853_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:12:26Z","timestamp":1558296746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11493853_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}