{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:29:04Z","timestamp":1648988944145},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540794080","type":"print"},{"value":"9783540794097","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79409-7_7","type":"book-chapter","created":{"date-parts":[[2008,6,18]],"date-time":"2008-06-18T07:09:47Z","timestamp":1213772987000},"page":"87-110","source":"Crossref","is-referenced-by-count":8,"title":["Integer Programming Approaches to Access and Backbone IP Network Planning"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bley","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1_1","unstructured":"D. Alevras, M. Gr\u00f6tschel, and R. Wess\u00e4ly, Capacity and survivability models for telecommunications networks, Tech. Report SC 97-24, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, 1997."},{"key":"7_CR2_1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1287\/ijoc.8.3.289","volume":"8","author":"K Aardal","year":"1996","unstructured":"K. Aardal, M. Labb\u00e9, J. Leung, and M. Queyranne, On the two-level uncapacitated facility location problem, INFORMS Journal on Computing 8 (1996), 289\u2013301.","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR3_1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S0895480100377428","volume":"17","author":"W Ben-Ameur","year":"2003","unstructured":"W. Ben-Ameur and E. Gourdin, Internet routing and related topology issues, SIAM Journal on Discrete Mathematics 17 (2003), 18\u201349.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7_CR4_1","unstructured":"W. Ben-Ameur, E. Gourdin, and B. Liau, Internet routing and topology problems, Proceedings of DRCN2000 (Munich), 2000."},{"key":"7_CR5_1","first-page":"177","volume":"81","author":"D Bienstock","year":"1998","unstructured":"D. Bienstock, S. Chopra, O. G\u00fcnl\u00fck, and C-Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming 81 (1998), 177\u2013199.","journal-title":"Mathematical Programming"},{"key":"7_CR6_1","unstructured":"S. Borne, E. Gourdin, B. Liau, and A. Mahjoub, Design of survivable IP-over-optical networks, Proceedings of the First International Network Optimization Conference (INOC 2003), Paris, 2003, pp. 114\u2013118."},{"key":"7_CR7_1","doi-asserted-by":"crossref","unstructured":"A. Bley, M. Gr\u00f6tschel, and R. Wess\u00e4ly, Design of broadband virtual private networks: Model and heuristics for the B-WiN, Robust Communication Networks: Interconnection and Survivability (N. Dean, D. F. Hsu, and R. Ravi, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 53, AMS, 1998, pp. 1\u201316.","DOI":"10.1090\/dimacs\/053\/01"},{"key":"7_CR8_1","first-page":"13","volume":"54","author":"A Bley","year":"2000","unstructured":"A. Bley and T. Koch, Optimierung des G-WiN, DFN-Mitteilungen 54 (2000), 13\u201315.","journal-title":"DFN-Mitteilungen"},{"key":"7_CR9_1","doi-asserted-by":"crossref","unstructured":"A. Bley, T. Koch, and R. Wess\u00e4ly, Large-scale hierarchical networks: How to compute an optimal architecture?, Proceedings of Networks 2004 (Vienna), VDE Verlag, 2004, pp. 429\u2013434.","DOI":"10.1109\/NETWKS.2004.241224"},{"key":"7_CR10_1","unstructured":"A. Bley, A Lagrangian approach for integrated network design and routing in IP networks, Proceedings of the First International Network Optimization Conference (INOC 2003), Paris, 2003, pp. 107\u2013113."},{"key":"7_CR11_1","doi-asserted-by":"crossref","unstructured":"A. Bley, On the approximability of the minimum congestion unsplittable shortest path routing problem, Proceedings of 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, 2005, pp. 97\u2013110.","DOI":"10.1007\/11496915_8"},{"key":"7_CR12_1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.20163","volume":"50","author":"A Bley","year":"2007","unstructured":"A. Bley, Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths, Networks 50 (2007), 29\u201336.","journal-title":"Networks"},{"key":"7_CR13_1","unstructured":"A. Bley, Routing and capacity optimization for IP networks, Ph.D. thesis, Technische Universit\u00e4t Berlin, 2007."},{"key":"7_CR14_1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(90)90053-F","volume":"41","author":"EA Boyd","year":"1993","unstructured":"E. A. Boyd, Polyhedral results for the precedence-constrained knapsack problem, Discrete Applied Mathematics 41 (1993), 185\u2013201.","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR15_1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L Buriol","year":"2005","unstructured":"L. Buriol, M. Resende, C. Ribeiro, and M. Thorup, A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing, Networks 46 (2005), 36\u201356.","journal-title":"Networks"},{"key":"7_CR16_1","unstructured":"L. Buriol, M. Resende, and M. Thorup, Survivable IP network design with OSPF routing, Optimization Online (2004)."},{"key":"7_CR17_1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E Balas","year":"1978","unstructured":"E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM Journal on Applied Mathematics 34 (1978), 119\u2013148.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"7_CR18_1","unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA, ILOG CPLEX 7.5 reference manual, 2001, Information available at http:\/\/www.cplex.com"},{"key":"7_CR19_1","first-page":"63","volume":"22","author":"J Crowcroft","year":"1992","unstructured":"J. Crowcroft and Z. Wang, Analysis of shortest-path routing algorithms in a dynamic network environment, ACM SIGCOM Computer Communication Review 22 (1992), 63\u201371.","journal-title":"ACM SIGCOM Computer Communication Review"},{"key":"7_CR20_1","unstructured":"M. Ericsson, M. G. C. Resende, and P. M. Pardalos, A genetic algorithm for the weight setting problem in OSPF routing, Tech. report, AT&T Labs Research, 2001."},{"key":"7_CR21_1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/65.826367","volume":"14","author":"A Feldmann","year":"2000","unstructured":"A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford, NetScope: Traffic engineering for IP networks, IEEE Network 14 (2000), 11\u201319.","journal-title":"IEEE Network"},{"key":"7_CR22_1","first-page":"247","volume":"74","author":"CE Ferreira","year":"1996","unstructured":"C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey, Formulations and valid inequalities of the node capacitated graph partitioning problem, Mathematical Programming 74 (1996), 247\u2013266.","journal-title":"Mathematical Programming"},{"key":"7_CR23_1","unstructured":"B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, Proceedings of IEEE INFOCOM 2000, 2000."},{"key":"7_CR24_1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B Fortz","year":"2004","unstructured":"B. Fortz and M. Thorup, Increasing internet capacity using local search, Computational Optimization and Applications 29 (2004), 13\u201348.","journal-title":"Computational Optimization and Applications"},{"key":"7_CR25_1","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C. L. Monma, and M. Stoer, Design of survivable networks, Handbooks in Operations Research and Management Science, vol. Network Models, ch. 10, pp. 617\u2013672, North-Holland, 1995.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"7_CR26_1","unstructured":"E. Gourdin, Optimizing internet networks, OR\/MS Today (2001), 46\u201349."},{"key":"7_CR27_1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","volume":"8","author":"L Hall","year":"1996","unstructured":"L. Hall, Experience with a cutting plane algorithm for the capacitated spanning tree problem, INFORMS Journal on Computing 8 (1996), 219\u2013234.","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR28_1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/net.10102","volume":"43","author":"K Holmberg","year":"2004","unstructured":"K. Holmberg and D. Yuan, Optimization of Internet protocol network design and routing, Networks 43 (2004), 39\u201353.","journal-title":"Networks"},{"key":"7_CR29_1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T Koch","year":"1998","unstructured":"T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks 32 (1998), 207\u2013232.","journal-title":"Networks"},{"key":"7_CR30_1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"H. Kerivin and A. Mahjoub, Design of survivable networks: A survey, Networks 46 (2005), 1\u201321.","journal-title":"Networks"},{"key":"7_CR31_1","unstructured":"F. Y. S. Lin and J. L. Wang, Minimax open shortest path first routing algorithms in networks suporting the SMDS service, Tech. report, Bell Communications Research, 1993."},{"key":"7_CR32_1","volume-title":"Integer programs with block structure","author":"A Martin","year":"1998","unstructured":"A. Martin, Integer programs with block structure, Habilitations-Schrift, Technische Universit\u00e4t Berlin, 1998."},{"key":"7_CR33_1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/S0377-2217(99)00464-6","volume":"129","author":"S Melkote","year":"2001","unstructured":"S. Melkote and M. S. Daskin, Capacitated facility location\/network design problems, European Journal of Operations Research 129 (2001), 481\u2013495.","journal-title":"European Journal of Operations Research"},{"key":"7_CR34_1","volume-title":"Discrete location theory","year":"1990","unstructured":"P. Mirchandani and R. Francis (eds.), Discrete location theory, Wiley, New York, 1990."},{"key":"7_CR35_1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6377(94)90038-8","volume":"16","author":"GL Nemhauser","year":"1994","unstructured":"G. L. Nemhauser and P. H. Vance, Lifted cover facets of the 0-1 knapsack polytope with GUB constraints, Operations Research Letters 16 (1994), 255\u2013263.","journal-title":"Operations Research Letters"},{"key":"7_CR36_1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1287\/mnsc.46.3.363.12066","volume":"46","author":"K Park","year":"2000","unstructured":"K. Park, K. Lee, S. Park, and H. Lee, Telecommunication node clustering with node compatibility and network survivability requirements, Management Science 46 (2000), 263\u2013374.","journal-title":"Management Science"},{"key":"7_CR37_1","unstructured":"M. Prytz, On optimization in design of telecommunications networks with multicast and unicast traffic, Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden, 2002."},{"key":"7_CR38_1","unstructured":"D. Staehle, S. K\u00f6hler, and U. Kohlhaas, Towards an optimization of the routing parameters for IP networks, Tech. report, Department of Computer Science, University of W\u00fcrzburg, 2000."},{"key":"7_CR39_1","unstructured":"R. Wunderling, Paralleler und objektorientierter simplex, Tech. Report TR 96-09, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, 1996, Information available at http:\/\/www.zib.de\/Optimization\/Software\/Soplex"}],"container-title":["Modeling, Simulation and Optimization of Complex Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79409-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:09Z","timestamp":1619522469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79409-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540794080","9783540794097"],"references-count":39,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-540-79409-7_7","relation":{},"published":{"date-parts":[[2008]]}}}