{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:52Z","timestamp":1750308112930,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,3,13]],"date-time":"2005-03-13T00:00:00Z","timestamp":1110672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066766","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"383-387","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid Lagrangian relaxation for bandwidth-constrained routing"],"prefix":"10.1145","author":[{"given":"Wided","family":"Ouaja","sequence":"first","affiliation":[{"name":"Imperial College London, London, UK"}]},{"given":"Barry","family":"Richards","sequence":"additional","affiliation":[{"name":"Imperial College London, London, UK"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network flows: Theory, algorithms and applications","author":"Ahuja R.","year":"1993","unstructured":"R. Ahuja , T. Magnanti , and J. Orlin . Network flows: Theory, algorithms and applications . Prentice Hall , Englewood Cliffs, NJ , 1993 . R. Ahuja, T. Magnanti, and J. Orlin. Network flows: Theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, 1993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1287\/opre.48.2.318.12378"},{"key":"e_1_3_2_1_3_1","first-page":"15","volume-title":"Proc CPAIOR'01","author":"Benoist T.","year":"2001","unstructured":"T. Benoist , F. Laburthe , and B. Rottembourg . Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems . In Proc CPAIOR'01 , pages 15 -- 26 , 2001 . T. Benoist, F. Laburthe, and B. Rottembourg. Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. In Proc CPAIOR'01, pages 15--26, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-540-30201-8_55"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc CoSolv'04","author":"Cronholm W.","year":"2004","unstructured":"W. Cronholm , W. Ouaja , and F. Ajili . Strengthening optimality reasoning for a network routing application . In Proc CoSolv'04 , CP'04, September 2004 . W. Cronholm, W. Ouaja, and F. Ajili. Strengthening optimality reasoning for a network routing application. In Proc CoSolv'04, CP'04, September 2004."},{"key":"e_1_3_2_1_6_1","first-page":"191","volume-title":"Proc ICNP'97","author":"Ma Q.","year":"1997","unstructured":"Q. Ma and P. Steenkiste . On path selection for traffic with bandwidth guarantees . In Proc ICNP'97 , pages 191 -- 202 , 1997 . Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In Proc ICNP'97, pages 191--202, 1997."},{"key":"e_1_3_2_1_7_1","first-page":"441","volume-title":"Proc INOC'03","author":"Ouaja W.","year":"2003","unstructured":"W. Ouaja and B. Richards . A hybrid solver for optimal routing of bandwidth-guaranteed traffic . In Proc INOC'03 , pages 441 -- 447 , 2003 . W. Ouaja and B. Richards. A hybrid solver for optimal routing of bandwidth-guaranteed traffic. In Proc INOC'03, pages 441--447, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1002\/net.v43:3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1023\/A:1021845304798"},{"key":"e_1_3_2_1_10_1","first-page":"845","volume-title":"Proc ESA'02","author":"Sellmann M.","year":"2002","unstructured":"M. Sellmann , G. Kliewer , and A. Koberstein . Capacitated network design . In Proc ESA'02 , pages 845 -- 858 , 2002 . M. Sellmann, G. Kliewer, and A. Koberstein. Capacitated network design. In Proc ESA'02, pages 845--858, 2002."},{"key":"e_1_3_2_1_11_1","first-page":"582","volume-title":"Proc ICCCN'99","author":"Wang Y.","year":"1999","unstructured":"Y. Wang and Z. Wang . Explicit routing algorithms for internet traffic engineering . In Proc ICCCN'99 , pages 582 -- 588 , 1999 . Y. Wang and Z. Wang. Explicit routing algorithms for internet traffic engineering. In Proc ICCCN'99, pages 582--588, 1999."}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC05","name":"SAC05: The 2005 ACM Symposium on Applied Computing","location":"Santa Fe New Mexico"},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066766","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:13Z","timestamp":1750262893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066766"}},"subtitle":["knapsack decomposition"],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":11,"alternative-id":["10.1145\/1066677.1066766","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066766","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}