{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:52:04Z","timestamp":1771235524096,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0166-218x(00)00310-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:07:57Z","timestamp":1027631277000},"page":"73-99","source":"Crossref","is-referenced-by-count":195,"title":["Bundle-based relaxation methods for multicommodity capacitated fixed charge network design"],"prefix":"10.1016","volume":"112","author":[{"given":"Teodor Gabriel","family":"Crainic","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Frangioni","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00310-3_BIB1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","article-title":"A generalization of Polyak's convergence result for subgradient optimization","volume":"37","author":"Allen","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB2","unstructured":"A. Balakrishnan, T.L. Magnanti, P. Mirchandani, Network design, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997, pp. 311\u2013334 (Chapter 18)."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","article-title":"Models for planning capacity expansion in local access telecommunication networks","volume":"33","author":"Balakrishnan","year":"1991","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(00)00310-3_BIB4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design \u2013 polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"INFORMS J. Comp."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Math. Programming Study"},{"issue":"1","key":"10.1016\/S0166-218X(00)00310-3_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/opre.43.1.43","article-title":"Lower bounding procedures for multiperiod telecommunications network expansion problems","volume":"43","author":"Chang","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB7","unstructured":"T.G. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems, Publication CRT-98-45, Centre de recherche sur les transports, Universit\u00e9 de Montreal, 1998."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB8","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, M. Gendreau, J. Farvolden, Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. Comput. 12(3) (2000).","DOI":"10.1287\/ijoc.12.3.223.12638"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB9","series-title":"Computational improvements for subgradient optimization","volume":"Vol. XIX","author":"Crowder","year":"1976"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB10","unstructured":"O. du Merle, J.-L. Goffin, C. Trouiller, J.-P. Vial, A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm, Research Report 97-5, Logilab, University of Geneva, 1998."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1018318117350","article-title":"On improvements to the analytic center cutting plane method","volume":"11","author":"du Merle","year":"1998","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/S0166-218X(00)00310-3_BIB12","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","article-title":"Solving semidefinite quadratic problems within nonsmooth optimization algorithms","volume":"23","author":"Frangioni","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB13","unstructured":"A. Frangioni, Dual-ascent methods, and multicommodity flow problems, Ph.D. Thesis, Dipartimento di informatica, Universit\u00e0 di Pisa, 1997."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB14","unstructured":"A. Frangioni, Generalized bundle methods, Technical Report TR-98-04, Dipartimento di informatica, Universit\u00e1 di Pisa, 1998."},{"issue":"4","key":"10.1016\/S0166-218X(00)00310-3_BIB15","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1287\/ijoc.11.4.370","article-title":"A bundle type dual-ascent approach to linear multicommodity min cost flow problems","volume":"11","author":"Frangioni","year":"1999","journal-title":"INFORMS J. Comp."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","article-title":"Topological design of telecommunications network \u2013 local access design methods","volume":"33","author":"Gavish","year":"1991","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB17","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\/S0166-218X(00)00310-3_BIB18","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\/S0166-218X(00)00310-3_BIB19","series-title":"Telecommunications Network Planning","first-page":"1","article-title":"Multicommodity capacitated network design","author":"Gendron","year":"1998"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02614381","article-title":"Solving nonlinear multicommodity flow problems by the analytic center cutting plane method","volume":"76","author":"Goffin","year":"1996","journal-title":"Math. Programming"},{"issue":"2","key":"10.1016\/S0166-218X(00)00310-3_BIB22","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","article-title":"Decomposition and nondifferentiable optimization with the projective algorithm","volume":"38","author":"Goffin","year":"1992","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB23","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1979"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB24","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB25","series-title":"Convex analysis and minimization algorithms II","volume":"Vol. 306","author":"Hiriart-Urruty","year":"1993"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB26","doi-asserted-by":"crossref","unstructured":"K. Holmberg, D. Yuan, A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem, Research Report LiTH-MAT-R-1996-23, Department of Mathematics, Link\u00f6ping Institute of Technology, Oper. Res. (1996) forthcoming.","DOI":"10.1007\/978-3-642-60744-8_15"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB27","first-page":"703","article-title":"The cutting-plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. SIAM"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB28","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","article-title":"Conditional subgradient optimization \u2013 theory and applications","volume":"88","author":"Larsson","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB29","doi-asserted-by":"crossref","unstructured":"C. Lemar\u00e9chal, Nondifferentiable optimization, in: G.L. Nemhauser, A.H.G. Rinnoy Kan, M.J. Todd (Eds.), Handbooks in Operations Research and Management Science, Chapter 7, Optimization, Vol. 1, 1989, pp. 529\u2013572.","DOI":"10.1016\/S0927-0507(89)01008-X"},{"issue":"1","key":"10.1016\/S0166-218X(00)00310-3_BIB30","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","article-title":"Modeling and solving the two-facility capacitated network loading problem","volume":"43","author":"Magnanti","year":"1995","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0166-218X(00)00310-3_BIB31","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 Sci."},{"key":"10.1016\/S0166-218X(00)00310-3_BIB32","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"},{"key":"10.1016\/S0166-218X(00)00310-3_BIB33","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of nonsmooth functionals","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. and Math. Phys."},{"issue":"1","key":"10.1016\/S0166-218X(00)00310-3_BIB34","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","article-title":"A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results","volume":"2","author":"Schramm","year":"1992","journal-title":"SIAM J. Optim."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T16:57:07Z","timestamp":1681405027000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0166218X00003103"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00310-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}