{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:39Z","timestamp":1751429439251,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1013867331662","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:50:27Z","timestamp":1041101427000},"page":"205-232","source":"Crossref","is-referenced-by-count":5,"title":["D.C. programming approach for multicommodity network optimization problems with step increasing cost functions"],"prefix":"10.1007","volume":"22","author":[{"given":"Le Thi","family":"Hoai An","sequence":"first","affiliation":[]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"383103_CR1","unstructured":"K.T. Ahuja, T. Magnanti and J. Orlin. Networks Flows: Theory, Algorithms and Applications. Prentice Hall, 1993."},{"key":"383103_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A.A. Assad","year":"1978","unstructured":"A.A. Assad. Multicommodity network flows-A survey. Networks 8: 37\u201391, 1978.","journal-title":"Networks"},{"key":"383103_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230190202","volume":"19","author":"A. Balakrisnan","year":"1989","unstructured":"A. Balakrisnan and S.C. Graves. A composite algorithm for a concave-cost network flow problem. Networks 19: 175\u2013202, 1989.","journal-title":"Networks"},{"key":"383103_CR4","unstructured":"D.P. Bertsekas and R.G. Gallager. Data Netwoks. Prentice Hall, 1987."},{"key":"383103_CR5","unstructured":"F. Boyer. Conception et Routage des R\u00e9seaux de T\u00e9l\u00e9communications. Th\u00e8se de Doctorat de l'Universit\u00e9 Blaise Pascal, Clermont-Ferrand, 1997."},{"key":"383103_CR6","first-page":"183","volume":"4","author":"V.J.M. Ferreira Filho","year":"1994","unstructured":"V.J.M. Ferreira Filho and R.D. Galvao. A Survey of Computer Network Design Problems. Investigacion Operativa 4: 183\u2013211, 1994.","journal-title":"Investigacion Operativa"},{"key":"383103_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"L. Fratta, M. Gerla and L. Kleinrock. The flow deviation method: an approach to store-andforward communications network design. Networks 3: 97\u2013133, 1973.","journal-title":"Networks"},{"key":"383103_CR8","unstructured":"V. Gabrel and M. Minoux. Large scale LP relaxations for minimum cost multicommodity flow problems with step increasing cost functions and computational results. Technical Report, Laboratoire MASI, Univ. Paris 6, 1996."},{"key":"383103_CR9","first-page":"128","volume":"22","author":"V. Gabrel","year":"1997","unstructured":"V. Gabrel and M. Minoux. LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions. Acta Mathematica Vietnamica 22: 128\u2013145, 1997.","journal-title":"Acta Mathematica Vietnamica"},{"key":"383103_CR10","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"COM-33","author":"B. Gavish","year":"1985","unstructured":"B. Gavish. Augmented Lagrangian based bounds for centralized network design. IEEE Transactions on Communications COM-33, 1247\u20131257, 1985.","journal-title":"IEEE Transactions on Communications"},{"key":"383103_CR11","doi-asserted-by":"crossref","unstructured":"B. Gavish and K. Altinkemer. Backbone network design tools with economic tradeoffs ORSA J. on Computing 2\/3: 236\u2013252.","DOI":"10.1287\/ijoc.2.3.236"},{"key":"383103_CR12","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/26.20116","volume":"COM-37","author":"B. Gavish","year":"1989","unstructured":"B. Gavish and G.W. Graves. System for routing and capacity assignment in computer communication network. IEEE Transactions on Communications COM-37: 360\u2013366, 1989.","journal-title":"IEEE Transactions on Communications"},{"key":"383103_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"COM-25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Kleinrock. On the tological design of distributed computer networks. IEEE Transactions on Communications COM-25: 48\u201360, 1977.","journal-title":"IEEE Transactions on Communications"},{"key":"383103_CR14","unstructured":"M. Gerla The Design of Store-and-Forward Networks for Computer Communications. PhD Thesis, UCLA, 1973."},{"key":"383103_CR15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"COM-25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Keinrock. On the topological design of distributed computer networks. IEEE Transactions on Communications COM-25: 48\u201360, 1977.","journal-title":"IEEE Transactions on Communications"},{"key":"383103_CR16","doi-asserted-by":"crossref","unstructured":"M. Gerla, R. Monteiro and R. Pazos, Topology design and bandwith allocation in ATM nets. IEEE transactions on selected Area in Communications SAC-7, 1989.","DOI":"10.1109\/49.35570"},{"key":"383103_CR17","volume-title":"Graphes et Algorithmes","author":"M. Gondran","year":"1995","unstructured":"M. Gondran and M. Minoux. Graphes et Algorithmes Eyrolles, Paris 2nd edition 1995.","edition":"2nd edition"},{"key":"383103_CR18","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.B. Hiriart Urruty","year":"1993","unstructured":"J.B. Hiriart Urruty and C. Lemarechal Convex Analysis and Minimization Algorithms. Springer, Berlin, 1993."},{"key":"383103_CR19","volume-title":"Approximation et Optimisation","author":"P.J. Laurent","year":"1972","unstructured":"P.J. Laurent. Approximation et Optimisation. Hermann, Paris, 1972."},{"key":"383103_CR20","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"R. Horst, P.M. Pardalos and V.T. Nguyen. Introduction to Global Optimization, Kluwer, Dordrecht, 1995."},{"key":"383103_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R. Horst","year":"1999","unstructured":"R. Horst and V.T. Nguyen. D.C. Programming: Overview. Journal of Optimization Theory and Applications, 103: 1\u201343, 1999.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"383103_CR22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J.L. Kennington","year":"1978","unstructured":"J.L. Kennington. A survey of linear cost multicommodity network flows. Operations Research 26: 209\u2013236, 1978.","journal-title":"Operations Research"},{"key":"383103_CR23","unstructured":"H.A. Le Thi. Contribution \u00e0 l'optimisation non convexe et l'optimisation globale: Th\u00e9orie, Algorithmes et Applications. Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Rouen, 1997."},{"key":"383103_CR24","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Le Thi","year":"1997","unstructured":"H.A. Le Thi and T. Pham Dinh. Solving a class of linearly constrained indefinite quadratic problems by D.c. algorithms. Journal of Global Optimization 11: 253\u2013285, 1997.","journal-title":"Journal of Global Optimization"},{"key":"383103_CR25","volume-title":"Technical Report","author":"H.A. Le Thi","year":"1998","unstructured":"H.A. Le Thi and T. Pham Dinh. D.c. models of real world nonconvex optimization problems. Technical Report, LMI, INSA-Rouen, 1998."},{"key":"383103_CR26","first-page":"301","volume-title":"Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches","author":"H.A. Le Thi","year":"2000","unstructured":"H.A. Le Thi and T. Pham Dinh. D.c. programming approach for large-scale molecular optimization via the general distance geometry problem, in Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches, C.A. Floudas and P.M. Pardalos (Eds.), pp. 301\u2013339, Kluwer Academic Publishers, Dordrecht, 2000."},{"issue":"3","key":"383103_CR27","first-page":"1","volume":"45","author":"H.A. Le Thi","year":"2001","unstructured":"H.A. Le Thi and T. Pham Dinh, A continuous approach for large-scale linearly constrained quadratic zero-one programming. Optimization, 45(3) 1\u201328, 2001.","journal-title":"Optimization"},{"key":"383103_CR28","unstructured":"J. Mac Gregor Smith and P. Winter (eds). Topological NetWork Design. Annals of Operations Research 33, 1991."},{"key":"383103_CR29","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1137\/0805023","volume":"5","author":"P. Mahey","year":"1995","unstructured":"P. Mahey and T. Pham Dinh. Proximal decomposition on the graph of a maximal monotone operator. SIAM Journal on Optimization, 5: 454\u2013468, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"383103_CR30","unstructured":"T.Q. Nguyen. Une approche D.c. en Optimisation dans les R\u00e9seaux. Algorithmes, Codes et Simulations Num\u00e9riques. PhD Thesis, Universit\u00e9 de Rouen, 1999."},{"key":"383103_CR31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<227::AID-NET3>3.0.CO;2-F","volume":"31","author":"P. Mahey","year":"1998","unstructured":"P. Mahey, A. Ourou, L. Leblanc and J. Chifflet. A new proximal decomposition algorithm for routing in telecommunications networks. Networks 31: 227\u2013338, 1998.","journal-title":"Networks"},{"key":"383103_CR32","unstructured":"P. Mahey and H.P.L. Luna. Bounds for Global Optimization of Capacity Expansion and Flow Assignment Problems. to appear in Operations Research Letters."},{"key":"383103_CR33","unstructured":"P. Mahey and H.P.L. Luna. Separable convexification techniques for capacity and flow assignment problems. To appear."},{"key":"383103_CR34","unstructured":"V.T. Nguyen. D.C. Programming. in Encyclopedia of Optimization Kluwer Academic Publishers, Dordrecht."},{"key":"383103_CR35","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux. Network synthesis and Optimum Network design problems: Models, Solution Methods and Applications. Networks 19: 313\u2013360, 1989.","journal-title":"Networks"},{"key":"383103_CR36","unstructured":"A. Ouorou. D\u00e9composition proximale des probl\u00e8mes de multiflots \u00e0 crit\u00e8re convexe-Applications aux probl\u00e8mes de routage dans les r\u00e9seaux de communications. Th\u00e8se de Doctorat, Universit\u00e9 de Clermont-Ferrand, 1995."},{"key":"383103_CR37","unstructured":"T. Pham Dinh and H.A. Le Thi Convex analysis approach to d.c. programming: Theory, Algorithms and Applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday). Acta Mathematica Vietnamica. 22(1): 289\u2013355."},{"key":"383103_CR38","doi-asserted-by":"crossref","unstructured":"T. Pham Dinh and H.A. Le Thi. D.c. optimization algorithms for trust region problem. SIAM J. Optimization, 8(2): 476\u2013505.","DOI":"10.1137\/S1052623494274313"},{"key":"383103_CR39","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar. Convex Analysis. Princeton University, Princeton 1970."},{"key":"383103_CR40","doi-asserted-by":"crossref","unstructured":"R.T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM J. Control and Optimization, 14(5): 877\u2013898.","DOI":"10.1137\/0314056"},{"key":"383103_CR41","doi-asserted-by":"crossref","unstructured":"B. Sanso, F. Soumis and M. Gendreau. On the evaluation of telecommunication networks reliability using routing models. IEEE Transactions on Communications COM-3, 1494\u20131501.","DOI":"10.1109\/26.103044"},{"key":"383103_CR42","unstructured":"J.F. Toland. On subdifferential calculus and duality in nonconvex optimization. Bull. Soc. Math. France M\u00e9moire 60: 173\u2013180."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013867331662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013867331662\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013867331662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:44:56Z","timestamp":1751366696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013867331662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":42,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["383103"],"URL":"https:\/\/doi.org\/10.1023\/a:1013867331662","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}