{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:03:54Z","timestamp":1725483834962},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_40","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"603-617","source":"Crossref","is-referenced-by-count":13,"title":["Constraint Programming Contribution to Benders Decomposition: A Case Study"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Benoist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etienne","family":"Gaudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benoit","family":"Rottembourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"J. F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238\u2013252, 1962.","journal-title":"Numerische Mathematik"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A. M. Geoffi\u00efon","year":"1974","unstructured":"A. M. Geoffi\u00efon and G. W. Graves. Multicomodity distribution system design by Benders decomposition. Management Science, 20:822\u2013844, 1974.","journal-title":"Management Science"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux. Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications. Network, 19:313\u2013360, 1989.","journal-title":"Network"},{"issue":"5","key":"40_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0142-0615(93)90047-Q","volume":"15","author":"N. Kagan","year":"1993","unstructured":"N. Kagan and R. N. Adams. A Benders\u2019 Decomposition Approach To The Multi-Objective Distribution Planning Problem. International Journal of Electrical Power & Energy Systems, 15(5):259\u2013271,1993.","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581648","volume":"19","author":"R.M. Wollmer","year":"1980","unstructured":"R.M. Wollmer. Two stage linear programming under uncertainty with 0-1 first stage variables. Mathematical Programming, 19:279\u2013288, 1980.","journal-title":"Mathematical Programming"},{"key":"40_CR6","unstructured":"J.N. Hooker and G. Ottosson. Logic-based Benders decomposition. Mathematical Programming, to appear in November 2001."},{"key":"40_CR7","first-page":"1","volume":"LNCS","author":"A. Eremin","year":"2001","unstructured":"A. Eremin and M. Wallace. Hybrid Benders decomposition algorithms in constraint logic programming. CP 2001, LNCS, 2239:1\u201315, 2001.","journal-title":"CP 2001"},{"key":"40_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-45578-7_2","volume-title":"Proceedings of CP-01","author":"E. S. Thornsteinsson","year":"2001","unstructured":"E. S. Thornsteinsson. Branch-and-Check: a Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. In Proceedings of CP-01, Lecture Notes in Computer Science, 2239:16\u201330. Springer-Verlag, November 2001."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"V. Jain, I. E. Grossmann. Algorithms for Hybrid MILP\/CP Models for a Class of Optimization Problems. In Informs Journal On Computing, 13:258\u2013276, 2001.","journal-title":"Informs Journal On Computing"},{"key":"40_CR10","volume-title":"Programming, Games and Transportation Networks","author":"C. Berge","year":"1962","unstructured":"C. Berge and A. Ghouila-Houri. Programming, Games and Transportation Networks. Wiley, New York, 1962."},{"key":"40_CR11","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal. Linear Programming. W. H. Freeman, New York, 1983."},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"XPRESS-MP. http:\/\/www.dash.co.uk , 2002.","DOI":"10.1145\/504689.504690"},{"key":"40_CR13","unstructured":"F. Laburthe and the OCRE project team. CHOCO: Implementing a CP kernel. CP 2000 Workshop Program, 2000."},{"key":"40_CR14","volume-title":"Proceeding of ICLP\u201999","author":"Y. Caseau","year":"1999","unstructured":"Y. Caseau, F.-X. Josset, F. Laburthe. Claire: Combining Sets, Search and Rules to Better Express Algorithms. Proceeding of ICLP\u201999, MIT Press, New Mexico, 1999."},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"N. Beldiceanu and E. Contejean. Introducing Global Constraints in CHIP. Mathematical and Computer Modeling, 20(2):97\u2013123, 1994.","journal-title":"Mathematical and Computer Modeling"},{"key":"40_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-45578-7_14","volume-title":"CP 2001","author":"A. Bockmayr","year":"2001","unstructured":"A. Bockmayr, N. Pisaruk and A. Aggoun. Network Flow Problems in Constraint Programming. CP 2001, LNCS, 2239:196\u2013210, 2001."},{"key":"40_CR17","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin. Network Flows: theory, algorithms and applications. Prentice Hall, 1993."},{"key":"40_CR18","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, 1989."},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. Proceedings of the 18 th ACMsymposium on Theory of Computing, 1986.","DOI":"10.1145\/12130.12144"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T21:19:44Z","timestamp":1683839984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}