{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T16:10:01Z","timestamp":1747671001910,"version":"3.40.5"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/glocom.2014.7036988","type":"proceedings-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T19:54:30Z","timestamp":1424202870000},"page":"1303-1309","source":"Crossref","is-referenced-by-count":5,"title":["Methods for time-dependent combined network design and routing optimization"],"prefix":"10.1109","author":[{"given":"Dimitri","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/net.21461"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1270-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.1.101"},{"key":"1","article-title":"Time-dependent combined network design and routing optimization","author":"fortz","year":"2013","journal-title":"IRIDIA - Universite? Libre de Bruxelles Tech Rep"},{"key":"7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"geoffrion","year":"1974","journal-title":"Math Prog Study"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.012"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386316"},{"key":"4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","article-title":"Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems","volume":"112","author":"crainic","year":"2001","journal-title":"Discrete Appl Math"},{"journal-title":"Integer and Combinatorial Optimization","year":"1999","author":"nemhauser","key":"9"},{"key":"8","article-title":"Wiley encyclopedia of operations research and management science","author":"lim","year":"2011","journal-title":"Ch Relationship among Benders Dantzig-Wolfe and Lagrangian Optimization"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"12","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"Sndlib 1. 0-survivable network design library","volume":"55","author":"orlowski","year":"2010","journal-title":"Networks"}],"event":{"name":"GLOBECOM 2014 - 2014 IEEE Global Communications Conference","start":{"date-parts":[[2014,12,8]]},"location":"Austin, TX, USA","end":{"date-parts":[[2014,12,12]]}},"container-title":["2014 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008954\/7036769\/07036988.pdf?arnumber=7036988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T15:28:18Z","timestamp":1747668498000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7036988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/glocom.2014.7036988","relation":{},"subject":[],"published":{"date-parts":[[2014,12]]}}}