{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:04:32Z","timestamp":1786143872850,"version":"3.56.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T00:00:00Z","timestamp":1216944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10732-008-9091-1","type":"journal-article","created":{"date-parts":[[2008,7,24]],"date-time":"2008-07-24T09:20:07Z","timestamp":1216891207000},"page":"259-281","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for the non-bifurcated network design problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Enrico","family":"Bartolini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,7,25]]},"reference":[{"key":"9091_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/opre.50.2.333.423","volume":"50","author":"K. Agarwal","year":"2002","unstructured":"Agarwal, K.: Design of capacitated multicommodity networks with multiple facilities. Oper. Res. 50, 333\u2013344 (2002)","journal-title":"Oper. Res."},{"key":"9091_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A., Rajan, D.: On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"9091_CR3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 823\u2013837 (1996)","journal-title":"SIAM J. Optim."},{"key":"9091_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-6377(99)00071-1","volume":"26","author":"F. Barahona","year":"2000","unstructured":"Barahona, F.: On the k-cut problem. Oper. Res. Lett. 26, 99\u2013105 (2000)","journal-title":"Oper. Res. Lett."},{"key":"9091_CR5","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48, 318\u2013326 (2000)","journal-title":"Oper. Res."},{"key":"9091_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated network design\u2014polyhedral structure and computation. ORSA J. Comput. 8, 243\u2013260 (1996)","journal-title":"ORSA J. Comput."},{"key":"9091_CR7","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.-Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81, 177\u2013199 (1998)","journal-title":"Math. Program."},{"key":"9091_CR8","unstructured":"Brockm\u00fcller, B., G\u00fcnl\u00fck, O., Wolsey, L.A.: Designing private line networks\u2014Polyhedral analysis and computation. Discussion Paper 9647, Center for Operations Research and Econometrics, October 1996"},{"key":"9091_CR9","unstructured":"Brockm\u00fcller, B., G\u00fcnl\u00fck, O., Wolsey, L.A.: Designing private line networks\u2014Polyhedral analysis and computation. Discussion Paper 9647 revised, Center for Operations Research and Econometrics, March 1998"},{"key":"9091_CR10","unstructured":"CPLEX: ILOG CPLEX 10.1 callable library. ILOG (2007)"},{"key":"9091_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12, 223\u2013236 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9091_CR12","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN (2007)"},{"key":"9091_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9091_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","volume":"2","author":"B. Gavish","year":"1990","unstructured":"Gavish, B., Altinkemer, K.: Backbone network design tools with economic tradeoffs. ORSA J. Comput. 2, 236\u2013252 (1990)","journal-title":"ORSA J. Comput."},{"key":"9091_CR15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I. Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51, 655\u2013667 (2003)","journal-title":"Oper. Res."},{"key":"9091_CR16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I. Ghamlouche","year":"2004","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131, 109\u2013133 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9091_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"key":"9091_CR18","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/j.ejor.2004.09.006","volume":"171","author":"H. H\u00f6ller","year":"2006","unstructured":"H\u00f6ller, H., Vo\u00df, S.: A heuristic approach for combined equipment-planning and routing in multi-layer SDH\/WDM networks. Eur. J. Oper. Res. 171, 787\u2013796 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9091_CR19","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.ejor.2006.12.060","volume":"191","author":"H. H\u00f6ller","year":"2008","unstructured":"H\u00f6ller, H., Melian, B., Vo\u00df, S.: Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH\/WDM networks. Eur. J. Oper. Res. 191, 691\u2013704 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9091_CR20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"9091_CR21","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1057\/jors.1993.115","volume":"44","author":"I. Kousik","year":"1993","unstructured":"Kousik, I., Ghosh, D., Murthy, I.: A heuristic procedure for leasing channels in telecommunications networks. J.\u00a0Oper. Res. Soc. 44, 659\u2013672 (1993)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9091_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1986","unstructured":"Magnanti, T.L., Wong, R.T.: Network design and transportation planning: Models and algorithms. Transp. Sci. 18, 1\u201355 (1986)","journal-title":"Transp. Sci."},{"key":"9091_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"9091_CR24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43, 142\u2013157 (1995)","journal-title":"Oper. Res."},{"key":"9091_CR25","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M.: Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19, 313\u2013360 (1989)","journal-title":"Networks"},{"key":"9091_CR26","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070200292","volume":"92","author":"S.P.M. Hoesel van","year":"2002","unstructured":"van Hoesel, S.P.M., Koster, A.M.C.A., de Leensel, R.L.M.J., Savelsbergh, M.W.P.: Polyhedral results for the edge capacity polytope. Math. Program. 92, 335\u2013358 (2002)","journal-title":"Math. Program."},{"key":"9091_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(03)00436-0","volume":"133","author":"S.P.M. Hoesel van","year":"2004","unstructured":"van Hoesel, S.P.M., Koster, A.M.C.A., de Leensel, R.L.M.J., Savelsbergh, M.W.P.: Bidirected and unidirected capacity installation in telecommunication networks. Discrete Appl. Math. 133, 103\u2013121 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9091_CR28","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9091-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-008-9091-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9091-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:30Z","timestamp":1559242470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-008-9091-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,25]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9091"],"URL":"https:\/\/doi.org\/10.1007\/s10732-008-9091-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,25]]}}}