{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:28:38Z","timestamp":1757543318528,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/ngi.2010.5534462","type":"proceedings-article","created":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T20:23:28Z","timestamp":1280867008000},"page":"1-8","source":"Crossref","is-referenced-by-count":14,"title":["Towards robust network design using integer linear programming techniques"],"prefix":"10.1109","author":[{"given":"Arie M. C. A.","family":"Koster","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Kutschka","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Raack","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0Survivable Network Design Library","author":"orlowski","year":"2009","journal-title":"Networks"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0280"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0397-3"},{"key":"ref32","article-title":"The robust network loading problem with dynamic routing","author":"mattia","year":"2010","journal-title":"Technical Report B-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.1.142"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230205"},{"journal-title":"NOBEL - Next generation Optical networks for Broadband European Leadership","year":"2004","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.264"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00083-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0396-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/net.20395"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.3.243"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581104"},{"key":"ref14","first-page":"107","article-title":"Multi-layer network design a model-based optimization approach","author":"bley","year":"2008","journal-title":"Proc of the PGTS 2008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.20165"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00024-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1.3-4.197"},{"journal-title":"Deutsche Forschungsnetz (DFN)","year":"0","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316209"},{"key":"ref4","article-title":"A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem","author":"altin","year":"2009","journal-title":"Tech Rep"},{"key":"ref28","article-title":"Valid inequalities for a robust knapsack polyhedron Application to the robust bandwidth packing problem","author":"klopfenstein","year":"2009","journal-title":"Proc of the Int Network Optimization Conference INOC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.20145"},{"journal-title":"CPLEX Version 12 1","article-title":"IBM ILOG","year":"2009","key":"ref27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100284"},{"key":"ref5","article-title":"The Robust Network Loading Problem under Polyhedral Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations","author":"altin","year":"2010","journal-title":"Informs Journal on Computing"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"kouvelis","year":"1997","journal-title":"Robust Discrete Optimization and Its Applications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-005-1741-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/777313.777314"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100286"},{"journal-title":"Abilene Internet2 Network","year":"0","key":"ref1"},{"key":"ref20","first-page":"156","article-title":"Traffic model for USA long distance optimal network","author":"dwivedi","year":"2000","journal-title":"Proc Optical Fiber Communication Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496305717"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896298130"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1154"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","article-title":"A branch and cut algorithm for capacitated network design problems","volume":"86","author":"g\u00fcnl\u00fck","year":"1999","journal-title":"Mathematical Programming"},{"journal-title":"SCIP (Solving Constraint Integer Programs) version 1 2 0","year":"2009","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.10.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/050626259"},{"key":"ref43","article-title":"Lagrangian relaxation as a solution approach to solving the survivable multi-hour network design problem","author":"terblanche","year":"2007","journal-title":"in Proc of the South African Telecommuniations and Networks Applications Conference - SATNAC 2007"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","article-title":"Mixing mixed-integer inequalities","volume":"90","author":"g\u00fcnl\u00fck","year":"2001","journal-title":"Mathematical Programming"}],"event":{"name":"2010 6th EURO-NGI Conference on Next Generation Internet Networks (NGI)","start":{"date-parts":[[2010,6,2]]},"location":"Paris, France","end":{"date-parts":[[2010,6,4]]}},"container-title":["6th EURO-NGI Conference on Next Generation Internet"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5512517\/5534454\/05534462.pdf?arnumber=5534462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T12:04:03Z","timestamp":1497873843000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5534462\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/ngi.2010.5534462","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}