{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T01:16:57Z","timestamp":1698628617784},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0377-2217(01)00110-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"671-675","source":"Crossref","is-referenced-by-count":8,"title":["A note on \u201ca dual-ascent approach to the fixed-charge capacitated network design problem\u201d"],"prefix":"10.1016","volume":"138","author":[{"given":"Bernard","family":"Gendron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00110-2_BIB1","unstructured":"A. Balakrishnan, Valid inequalities and algorithms for the network design problem with an application to LTL consolidation, Ph.D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, 1984"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","article-title":"A dual-ascent procedure for large-scale uncapacitated network design","volume":"37","author":"Balakrishnan","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB3","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems, Discrete Applied Mathematics 112 (2001) 73\u201399","DOI":"10.1016\/S0166-218X(00)00310-3"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB4","unstructured":"B. Gendron, T.G. Crainic, Relaxations for multicommodity capacitated network design problems, publication CRT-965, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1994"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB5","unstructured":"B. Gendron, T.G. Crainic, Bounding procedures for multicommodity capacitated fixed-charge network design problems, publication CRT-96-06, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1996"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB6","series-title":"Telecommunications Network Planning","first-page":"1","article-title":"Multicommodity capacitated network design","author":"Gendron","year":"1999"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB7","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01588244","article-title":"A direct dual method for the mixed plant location problem with some side constraints","volume":"17","author":"Guignard","year":"1979","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB8","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","article-title":"A dual-ascent approach to the fixed-charge capacitated network design problem","volume":"95","author":"Herrmann","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(01)00110-2_BIB9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","article-title":"A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem","volume":"48","author":"Holmberg","year":"2000","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB10","doi-asserted-by":"crossref","unstructured":"C. Lemar\u00e9chal, Nondifferentiable optimization, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Eds.), Optimization, Handbooks in Operations Research and Management Science, vol. 1, 1989. pp. 529\u2013572 (Chapter 7)","DOI":"10.1016\/S0927-0507(89)01008-X"},{"issue":"1","key":"10.1016\/S0377-2217(01)00110-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(01)00110-2_BIB12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design problems: Models solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:21:25Z","timestamp":1556929285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0377221701001102"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00110-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}