{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:57Z","timestamp":1725566157933},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_55","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"726-730","source":"Crossref","is-referenced-by-count":10,"title":["Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design"],"prefix":"10.1007","author":[{"given":"Wilhelm","family":"Cronholm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farid","family":"Ajili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)"},{"key":"55_CR2","unstructured":"Bienstock, D., Bley, A.: Capacitated network design with multicast commodities. Tech. Rep. ZIB 00\u201314, Konrad-Zuse-Zentrum f\u00fcr Inform., Berlin (2000)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Cronholm, W.: CP-based lagrange decomposition applied to multicast network design. PhD transfer thesis, IC-Parc, Imperial, London UK (2004)","DOI":"10.1007\/978-3-540-30201-8_55"},{"key":"55_CR4","unstructured":"ECLiPSe. Introduction. Tech. Rep. IC-PARC-03-01, Imperial, London UK (2002)"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Program.\u00a039 (1987)","DOI":"10.1007\/BF02592954"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res.\u00a048(3) (2000)","DOI":"10.1287\/opre.48.3.461.12439"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks\u00a032(3) (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O"},{"key":"55_CR8","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons Ltd., Chichester (1990)"},{"volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","year":"2003","key":"55_CR9","unstructured":"Milano, M. (ed.): Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"55_CR10","doi-asserted-by":"crossref","unstructured":"Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks\u00a043(3) (2004)","DOI":"10.1002\/net.10110"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Prytz, M., Forsgren, A.: Dimensioning multicast-enabled communications networks. Networks\u00a039(4) (2002)","DOI":"10.1002\/net.10026"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Sellmann, M., Fahle, T.: CP-based Lagrangian relaxation for the automatic recording problem. Ann. Oper. Res.\u00a0118(1) (2003)","DOI":"10.1023\/A:1021845304798"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:47:51Z","timestamp":1605761271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}