{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:56Z","timestamp":1759667876435},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00264-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"382-393","source":"Crossref","is-referenced-by-count":3,"title":["A primal partitioning approach for single and non-simultaneous multicommodity flow problems"],"prefix":"10.1016","volume":"123","author":[{"given":"Malika","family":"Hadjiat","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Maurras","sequence":"additional","affiliation":[]},{"given":"Yann","family":"Vaxes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0377-2217(99)00264-7_BIB1","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1287\/opre.41.6.1013","article-title":"Formulating a mixed integer programming problem to improve solvability","volume":"41","author":"Barnhart","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB2","first-page":"66","article-title":"Networks with side constraints: An LU factorization update","volume":"1","author":"Barr","year":"1986","journal-title":"The Annals of the Society of Logistics Engineering"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB3","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(67)80015-1","article-title":"Generalized upper bounding techniques","volume":"1","author":"Dantzig","year":"1967","journal-title":"Journal of Computer System Science"},{"issue":"4","key":"10.1016\/S0377-2217(99)00264-7_BIB5","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/opre.41.4.669","article-title":"A primal partitioning solution for multicommodity network flow problems","volume":"41","author":"Farvolden","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB6","unstructured":"B. Fortz, M. Labbe, F. Maffioli, Two-connected network with bounded meshes, Technical report IS-MG 96\/8, Universit\u00e9 Libre de Bruxelles, Brussels, August 1996"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB7","unstructured":"M. Gr\u00f6tschel, C. Monma, M. Stoer, Polyhedral approaches to network survivability, Technical report 189, Universit\u00e4t Augsburg, Institut f\u00fcr Mathematik, August 1990"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB8","unstructured":"M. Hadjiat, J.F. Maurras, Y. Vaxes, Solving telecommunication network design by branch and bound, in: Tenth Conference of the European Chapter on Combinatorial Optimization (ECCO X), Tenerife, 1997"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB9","unstructured":"M. Kovalev, J.F. Maurras, Y. Vaxes, About the convexe hull of the cycles of length three in complete graphs, in: Tenth Conference of the European Chapter on Combinatorial Optimization (ECCO X), Tenerife, 1997"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB10","series-title":"Optimization Theory for large Systems","author":"Lasdon","year":"1970"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB11","unstructured":"A. Lisser, R. Sarkissian, J.P. Vial, Optimal joint synthesis of base and reserve telecommunication networks, Technical report, Department of Management Studies, University of Geneva, Switzerland, 1995"},{"issue":"1","key":"10.1016\/S0377-2217(99)00264-7_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230070102","article-title":"A generalized upper bounding approach to a communication network planning problem","volume":"7","author":"MacCallum","year":"1977","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","article-title":"The elimination form of inverse and its applications to linear programming","volume":"3","author":"Markovitz","year":"1957","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0012-365X(96)00194-X","article-title":"Multicommodity network flow with jump constraints","volume":"165\/166","author":"Maurras","year":"1997","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB15","doi-asserted-by":"crossref","unstructured":"M. Minoux, Optimum synthesis of a network with non-simultaneous flow requirements, In: P. Hansen (Ed.), Studies on Graphs and Discrete Programming, North-Holland, Amsterdam, 1981, pp. 313\u2013360","DOI":"10.1016\/S0304-0208(08)73470-4"},{"issue":"4","key":"10.1016\/S0377-2217(99)00264-7_BIB16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communications networks with certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00264-7_BIB17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","article-title":"A polyhedral approach to multicommodity survivable network design","volume":"68","author":"Stoer","year":"1994","journal-title":"Numerische Mathematik"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:24:50Z","timestamp":1556162690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0377221799002647"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00264-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}