{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:56:39Z","timestamp":1772668599065,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T00:00:00Z","timestamp":1427241600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s12532-015-0079-1","type":"journal-article","created":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T09:45:48Z","timestamp":1427190348000},"page":"189-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Solving network design problems via iterative aggregation"],"prefix":"10.1007","volume":"7","author":[{"given":"Andreas","family":"B\u00e4rmann","sequence":"first","affiliation":[]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Merkert","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Thurner","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Weninger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,25]]},"reference":[{"key":"79_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Modern Phys."},{"issue":"1","key":"79_CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.13.1.82","volume":"13","author":"E Balas","year":"1965","unstructured":"Balas, E.: Solution of large-scale transportation problems through aggregation. Oper. Res. 13(1), 82\u201393 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"79_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"79_CR4","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Hammer, P., Johnson, E., Korte, B., Nemhauser, G. (eds.) Studies in Integer Programming, volume 1 of Annals of Discrete Mathematics, vol. 1, pp. 145\u2013162. Elsevier (1977)","DOI":"10.1016\/S0167-5060(08)70731-3"},{"issue":"6","key":"79_CR5","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa, A.M.: A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005)","journal-title":"Comput. Oper. Res."},{"key":"79_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"TG Crainic","year":"2001","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112, 73\u201399 (2001)","journal-title":"Discrete Appl. Math."},{"key":"79_CR7","unstructured":"Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge\u2014shortest paths. http:\/\/www.dis.uniroma1.it\/~challenge9\/ (2006)"},{"issue":"2","key":"79_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Progr. A 91(2), 201\u2013213 (2002)","journal-title":"Math. Progr. A"},{"key":"79_CR9","volume-title":"Iterative aggregation theory. Number 111 in Pure and applied mathematics","author":"L Dudkin","year":"1987","unstructured":"Dudkin, L., Rabinovich, I., Vakhutinsky, I.: Iterative aggregation theory. Number 111 in Pure and applied mathematics. Dekker, New York (1987)"},{"key":"79_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., Zanette, A.: A note on the selection of Benders\u2019 cuts. Math. Progr. Series B 124, 175\u2013182 (2010)","journal-title":"Math. Progr. Series B"},{"key":"79_CR11","unstructured":"Francis, V.E.: Aggregation of network flow problems. Ph.D. thesis, University of California (1985)"},{"key":"79_CR12","unstructured":"Geisberger, R.: Advanced route planning in transportation networks. Ph.D. thesis, Karlsruhe Institute of Technology (2011)"},{"key":"79_CR13","doi-asserted-by":"crossref","unstructured":"Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Soriano, P., Sans\u00f2, B. (eds.) Telecommunications network planning, vol. 98, pp. 1\u201319. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"79_CR14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume-title":"Approaches to integer programming, volume 2 of mathematical programming studies","author":"A Geoffrion","year":"1974","unstructured":"Geoffrion, A.: Lagrangean relaxation for integer programming. In: Balinski, M. (ed.) Approaches to integer programming, volume 2 of mathematical programming studies, pp. 82\u2013114. Springer, Berlin (1974)"},{"key":"79_CR15","unstructured":"Gurobi Optimization, Inc.: Gurobi optimizer reference manual. http:\/\/www.gurobi.com (2013)"},{"issue":"4","key":"79_CR16","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.38.4.619","volume":"38","author":"A Hallefjord","year":"1990","unstructured":"Hallefjord, A., Storoy, S.: Aggregation and disaggregation in integer programming problems. Oper. Res. 38(4), 619\u2013623 (1990)","journal-title":"Oper. Res."},{"issue":"1","key":"79_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Progr. 96(1), 33\u201360 (2003)","journal-title":"Math. Progr."},{"issue":"4","key":"79_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"DS Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks 8(4), 279\u2013285 (1978)","journal-title":"Networks"},{"issue":"1","key":"79_CR19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"M Karwan","year":"1979","unstructured":"Karwan, M., Rardin, R.: Some relationships between lagrangian and surrogate duality in integer programming. Math. Progr. 17(1), 320\u2013334 (1979)","journal-title":"Math. Progr."},{"key":"79_CR20","unstructured":"Lee, S.: Surrogate programming by aggregation. Ph.D. thesis, University of California (1975)"},{"key":"79_CR21","unstructured":"Leisten, R.: Iterative Aggregation und Mehrstufige Entscheidungsmodelle: Einordnung in Den Planerischen Kontext, Analyse Anhand Der Modelle Der Linearen Programmierung und Darstellung Am Anwendungsbeispiel Der Hierarchischen Produktionsplanung. Produktion Und Logistik. Physica (1995)"},{"key":"79_CR22","doi-asserted-by":"crossref","first-page":"S.413","DOI":"10.1023\/A:1018931224060","volume":"Bd. 82","author":"R Leisten","year":"1998","unstructured":"Leisten, R.: An LP-aggregation view on aggregation in multi-level production planning. Ann. Oper. Res. Bd. 82, S.413\u2013S.434 (1998)","journal-title":"Ann. Oper. Res."},{"key":"79_CR23","first-page":"112","volume-title":"Computational combinatorial optimization, volume 2241 of lecture notes in computer science","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational combinatorial optimization, volume 2241 of lecture notes in computer science, pp. 112\u2013156. Springer, Berlin (2001)"},{"issue":"3","key":"79_CR24","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.1090.0334","volume":"21","author":"J Linderoth","year":"2009","unstructured":"Linderoth, J., Margot, F., Thain, G.: Improving bounds on the football pool problem by integer programming and high-throughput computing. INFORMS J. Comput. 21(3), 445\u2013457 (2009)","journal-title":"INFORMS J. Comput."},{"key":"79_CR25","doi-asserted-by":"crossref","unstructured":"Litvinchev, I., Tsurkov, V.: Aggregation in large-scale optimization. In: Applied optimization, vol. 83. Springer (2003)","DOI":"10.1007\/978-1-4419-9154-6"},{"issue":"3","key":"79_CR26","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.ejor.2011.04.037","volume":"214","author":"R Macedo","year":"2011","unstructured":"Macedo, R., Alves, C., de Carvalho, J.V., Clautiaux, F., Hanafi, S.: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3), 536\u2013545 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"79_CR27","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D McDaniel","year":"1977","unstructured":"McDaniel, D., Devine, M.: A modified Benders\u2019 partitioning algorithm for mixed integer programming. Manag. Sci. 24(3), 312\u2013319 (1977)","journal-title":"Manag. Sci."},{"issue":"2","key":"79_CR28","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.ejor.2005.09.008","volume":"176","author":"AM Newman","year":"2007","unstructured":"Newman, A.M., Kuchta, M.: Using aggregation to optimize long-term production planning at an underground mine. Eur. J. Oper. Res. 176(2), 1205\u20131218 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"79_CR29","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0-Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007). Spa, Belgium (2007)"},{"issue":"4","key":"79_CR30","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"DF Rogers","year":"1991","unstructured":"Rogers, D.F., Plante, R.D., Wong, R.T., Evans, J.R.: Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. 39(4), 553\u2013582 (1991)","journal-title":"Oper. Res."},{"issue":"2","key":"79_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(74)90126-5","volume":"10","author":"I Rosenberg","year":"1974","unstructured":"Rosenberg, I.: Aggregation of equations in integer programming. Discrete Math. 10(2), 325\u2013341 (1974)","journal-title":"Discrete Math."},{"key":"79_CR32","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/978-3-642-33558-7_46","volume-title":"Principles and practice of constraint programming, lecture notes in computer science","author":"D Salvagnin","year":"2012","unstructured":"Salvagnin, D., Walsh, T.: A hybrid MIP\/CP approach for multi-activity shift scheduling. In: Milano, M. (ed.) Principles and practice of constraint programming, lecture notes in computer science, pp. 633\u2013646. Springer, Berlin (2012)"},{"key":"79_CR33","unstructured":"Zipkin, P.H.: Aggregation in linear programming. Ph.D. thesis, Yale University (1977)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-015-0079-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-015-0079-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-015-0079-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T05:55:25Z","timestamp":1566453325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-015-0079-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,25]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s12532-015-0079-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,25]]}}}