{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T10:03:57Z","timestamp":1708596237883},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,27]],"date-time":"2013-04-27T00:00:00Z","timestamp":1367020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-013-1371-y","type":"journal-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T06:48:07Z","timestamp":1367390887000},"page":"163-181","source":"Crossref","is-referenced-by-count":13,"title":["Robust delay-constrained routing in telecommunications"],"prefix":"10.1007","volume":"206","author":[{"given":"Hassan","family":"Hijazi","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Bonami","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Ouorou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,27]]},"reference":[{"issue":"1","key":"1371_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/ijoc.1100.0380","volume":"23","author":"A. Alt\u0131n","year":"2011","unstructured":"Alt\u0131n, A., Yaman, H., & P\u0131nar, M. \u00c7. (2011). The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations. INFORMS Journal on Computing, 23(1), 75\u201389.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"1371_CR2","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A. Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk, A., & Zhang, M. (2007). Two-stage robust network flow and design under demand uncertainty. Operations Research, 55(4), 662\u2013673.","journal-title":"Operations Research"},{"key":"1371_CR3","series-title":"International series in operations research and management science","volume-title":"Uncertainty and environmental decision making","author":"F. Babonneau","year":"2009","unstructured":"Babonneau, F., Vial, J.-P., & Apparigliato, R. (2009). International series in operations research and management science: Uncertainty and environmental decision making. Berlin: Springer."},{"key":"1371_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/978-3-540-24693-0_43","volume-title":"NETWORKING 2004, networking technologies, services, and protocols; performance of computer and communication networks; mobile and wireless communications","author":"S. Beker","year":"2004","unstructured":"Beker, S., Puech, N., & Friderikos, V. (2004). A tabu search heuristic for the offline MPLS reduced complexity layout design problem. In N. Mitrou, K. Kontovasilis, G.N. Rouskas, I. Iliadis, & L. Merakos (Eds.), Lecture notes in computer science: Vol.\u00a03042. NETWORKING 2004, networking technologies, services, and protocols; performance of computer and communication networks; mobile and wireless communications (pp. 514\u2013525). Berlin\/Heidelberg: Springer."},{"key":"1371_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Ameur, W. (2007). Between fully dynamic routing and robust stable routing. In Design and reliable communication networks, DRCN (pp. 1\u20136).","DOI":"10.1109\/DRCN.2007.4762277"},{"key":"1371_CR6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"6","author":"W. Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., & Kerivin, H. (2005). Routing of uncertain traffic demands. Optimization and Engineering, 6, 283\u2013313.","journal-title":"Optimization and Engineering"},{"issue":"2","key":"1371_CR7","first-page":"94","volume":"1","author":"W. Ben Ameur","year":"2006","unstructured":"Ben Ameur, W., & Ouorou, A. (2006). Mathematical models of the delay constrained routing problem. Algorithmic Operations Research, 1(2), 94\u2013103.","journal-title":"Algorithmic Operations Research"},{"key":"1371_CR8","series-title":"Electronic notes in discrete mathematics","first-page":"1113","volume-title":"ISCO 2010\u2014International symposium on combinatorial optimization","author":"W. Ben-Ameur","year":"2010","unstructured":"Ben-Ameur, W., & Zotkiewicz, M. (2010). Polynomial traffic demand polytope partitioning. In Electronic notes in discrete mathematics: Vol.\u00a036. ISCO 2010\u2014International symposium on combinatorial optimization (pp. 1113\u20131120)."},{"key":"1371_CR9","first-page":"353","volume-title":"Progress in combinatorial optimization","author":"W. Ben-Ameur","year":"2012","unstructured":"Ben-Ameur, W., Ouorou, A., & \u017botkiewicz, M. (2012). Robust routing in communication networks. In R.\u00a0Mahjoub (Ed.), Progress in combinatorial optimization (pp. 353\u2013389). London: Iste, Wiley."},{"issue":"4","key":"1371_CR10","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A. Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23(4), 769\u2013805.","journal-title":"Mathematics of Operations Research"},{"key":"1371_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A. Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., & Nemirovski, A. (1999). Robust solutions to uncertain linear programs. Operations Research Letters, 25, 1\u201313.","journal-title":"Operations Research Letters"},{"key":"1371_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A. Ben-tal","year":"2000","unstructured":"Ben-tal, A., & Nemirovski, A. (2000). Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming, 88, 411\u2013424.","journal-title":"Mathematical Programming"},{"key":"1371_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98, 49\u201371.","journal-title":"Mathematical Programming"},{"issue":"1","key":"1371_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"key":"1371_CR15","doi-asserted-by":"crossref","unstructured":"Casas, P., Larroca, F., Rougier, J.-L., & Vaton, S. (2009). Robust routing vs dynamic load-balancing a comprehensive study and new directions (pp. 123\u2013130).","DOI":"10.1109\/DRCN.2009.5340015"},{"issue":"3","key":"1371_CR16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/1324215.1324236","volume":"38","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C. (2007). Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News, 38(3), 106\u2013129.","journal-title":"SIGACT News"},{"issue":"1","key":"1371_CR17","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20165","volume":"50","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Shepherd, F. B., Oriolo, G., & Scutell\u00e1, M. G. (2007). Hardness of robust network design. Networks, 50(1), 50\u201354.","journal-title":"Networks"},{"key":"1371_CR18","unstructured":"CPLEX ILOG. www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ ."},{"key":"1371_CR19","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L. El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., & Lebret, H. (1997). Robust solutions to least-squares problems with uncertain data. SIAM Journal on Matrix Analysis and Applications, 18, 1035\u20131064.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1371_CR20","volume-title":"AMPL: a modeling language for mathematical programming","author":"R. Fourer","year":"2002","unstructured":"Fourer, R., Gay, D. M., & Kernighan, B. W. (2002). AMPL: a modeling language for mathematical programming. N. Scituate: Duxbury."},{"key":"1371_CR21","unstructured":"Hassan, H. (2010). Mixed integer nonlinear optimization approaches for network design in telecommunications. Ph.D. thesis."},{"key":"1371_CR22","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H. Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., & Ouorou, A. (2012). Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Computational Optimization and Applications, 52, 537\u2013558.","journal-title":"Computational Optimization and Applications"},{"key":"1371_CR23","first-page":"1","volume-title":"ICC","author":"A. M. C. A. Koster","year":"2011","unstructured":"Koster, A. M. C. A., Kutschka, M., & Raack, C. (2011). On the robustness of optimal network designs. In ICC (pp. 1\u20135)."},{"issue":"2","key":"1371_CR24","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10288-002-0010-2","volume":"1","author":"E. Martins","year":"2003","unstructured":"Martins, E., & Pascoal, M. (2003). A new implementation of yen\u2019s ranking loopless paths algorithm. 4OR, 1(2), 121\u2013133.","journal-title":"4OR"},{"key":"1371_CR25","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A. L. Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Convex programming with set-inclusive constraints ans applications to inexact linear programming. Operations Research, 21, 1154\u20131157.","journal-title":"Operations Research"},{"issue":"3","key":"1371_CR26","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1023\/A:1020855928538","volume":"20","author":"C. A. Eijl Van","year":"2002","unstructured":"Van Eijl, C. A. (2002). Capacity planning for carrier-scale ip networks. BT Technology Journal, 20(3), 116\u2013123.","journal-title":"BT Technology Journal"},{"issue":"1","key":"1371_CR27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., & Biegler, L. T. (2006). On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1), 25\u201357.","journal-title":"Mathematical Programming"},{"key":"1371_CR28","first-page":"148","volume":"2","author":"H.-H. Yen","year":"2001","unstructured":"Yen, H.-H., & Lin, F. Y.-S. (2001a). Backbone network design with qos requirements. ICN, 2, 148\u2013157.","journal-title":"ICN"},{"key":"1371_CR29","unstructured":"Yen, H.-H., & Lin, F. Y.-S. (2001b). Near-optimal delay constrained routing in virtual circuit networks. In INFOCOM (pp. 750\u2013756)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1371-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1371-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1371-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T07:14:56Z","timestamp":1563002096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1371-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,27]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1371"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1371-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,27]]}}}