{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:49:55Z","timestamp":1680439795399},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":[[2005,11]]},"DOI":"10.1007\/s10479-005-3967-3","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"49-65","source":"Crossref","is-referenced-by-count":5,"title":["B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty"],"prefix":"10.1007","volume":"140","author":[{"given":"R.","family":"Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Lisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Plateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3967_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"S. Ahmed","year":"2004","unstructured":"Ahmed, S., M. Tawarmalani, and N.V. Sahinidis. (2004). \u201cA Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs.\u201d Mathematical Programming 100, 355\u2013377.","journal-title":"Mathematical Programming"},{"key":"3967_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0377-2217(02)00628-8","volume":"151","author":"A. Alonso-Ayuso","year":"2003","unstructured":"Alonso-Ayuso, A., L.F. Escudero, and M.T. Ortu\u00f1o. (2003). \u201cBFC, A Branch-and-Fix Coordination Algorithmic Framework for Solving Some Types of Stochastic Pure and Mixed 0-1 Programs.\u201d European Journal of Operational Research 151, 503\u2013519.","journal-title":"European Journal of Operational Research"},{"key":"3967_CR3","unstructured":"Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2002a). \u201cSimulation on Two-stage Stochastic Integer Programming Problems in Telecommunication Networks.\u201d France Telecom R&D report NT\/FTR&D\/7595."},{"issue":"2","key":"3967_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/B:COAP.0000042027.65400.b3","volume":"29","author":"R. Andrade","year":"2004","unstructured":"Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2004). \u201cTelecommunication Network Capacity Design for Uncertain Demand.\u201d Computational Optimization and Applications 29(2), 127-146.","journal-title":"Computational Optimization and Applications"},{"key":"3967_CR5","unstructured":"Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2002b). \u201cPlanning Network Design Under Uncertainty with Fixed Charge.\u201d France Telecom R&D report NT\/FTR&D\/7597."},{"issue":"9","key":"3967_CR6","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1996). \u201cMixed 0-1 Programming by Lift-And-Project in a Branch-and-Cut Framework.\u201d Management Science 42(9), 1229\u20131246.","journal-title":"Management Science"},{"key":"3967_CR7","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research, Berlin."},{"key":"3967_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"C.C. Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C.C. and R. Schultz. (1999). \u201cDual Decomposition in Stochastic Integer Programming.\u201d Operations Research Letters 24, 37\u201345.","journal-title":"Operations Research Letters"},{"key":"3967_CR9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C.C. Car\u00f8e","year":"1998","unstructured":"Car\u00f8e, C.C. and J. Tind. (1998). \u201cThe L-Shaped Decomposition of Two-Stage Stochastic Programs with Integer Recourse.\u201d Mathematical Programming 83, 451\u2013464.","journal-title":"Mathematical Programming"},{"issue":"2","key":"3967_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(96)00399-2","volume":"101","author":"C.C. Car\u00f8e","year":"1997","unstructured":"Car\u00f8e, C.C. and J. Tind. (1997). \u201cA Cutting Plane Approach to Mixed 0-1 Stochastic Integer Programs.\u201d European Journal of Operational Research 101(2), 306\u2013316.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3967_CR11","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1287\/opre.50.2.260.436","volume":"50","author":"P. Chardaire","year":"2002","unstructured":"Chardaire, P. and A. Lisser. (2002). \u201cSimplex and Interior Point Specialization Algorithms for Solving Non-Oriented Multicommodity Flow Problems.\u201d Operations Research 50(2), 260\u2013276.","journal-title":"Operations Research"},{"key":"3967_CR12","unstructured":"CPLEX 6.5 User's Manual \u00a9 (1999). ILOG CPLEX Division, France."},{"key":"3967_CR13","first-page":"234","volume-title":"Network Optimization, Lecture Notes in Economics and Mathematical Systems 450","author":"F. Fantauzzi","year":"1997","unstructured":"Fantauzzi, F., A. Gaivoronski, and E. Messina. (1997). \u201cDecomposition Methods for Network Optimization Problems in the Presence of Uncertainty.\u201d In P. Pardalos, D. Hearn and W. Hager (eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems 450, Springer, Berlin, pp. 234\u2013248."},{"key":"3967_CR14","unstructured":"H\u00e4ggl\u00f6f, K. (1996). \u201cThe Implementation of the Stochastic Branch and Bound Method for Applications in River Basin Water Quality Management.\u201d IIASA Working Paper WP-96-89, Laxenburg, Austria."},{"key":"3967_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G. and F.V. Louveaux. (1993). \u201cThe Integer L-Shaped Method for Stochastic Integer Programs with Complete Recourse.\u201d Operations Research Letters 13, 133-142.","journal-title":"Operations Research Letters"},{"key":"3967_CR16","doi-asserted-by":"crossref","unstructured":"Lee, E.V. and J.E. Mitchell. (2001). Branch-and-Bound Methods for Integer Programming. in the Encyclopedia of Optimization, Kluwer Academic Publishers.","DOI":"10.1007\/0-306-48332-7_214"},{"key":"3967_CR17","unstructured":"Minoux, M. (1986). \u201cMathematical Programming: Theory and Algorithms.\u201d Wiley-Interscience."},{"issue":"3","key":"3967_CR18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.46.3.381","volume":"46","author":"V.I. Norkin","year":"1998","unstructured":"Norkin, V.I., Yu. M. Ermoliev, and A. Ruszczy\u0144ski. (1998). \u201cOn Optimal Allocation of Indivisibles Under Uncertainty.\u201d Operations Research 46(3), 381\u2013395.","journal-title":"Operations Research"},{"key":"3967_CR19","first-page":"425","volume":"83","author":"V.I. Norkin","year":"1998","unstructured":"Norkin, V.I. G.Ch. Pflug, and A. Ruszczy\u0144ski. (1998). \u201cA Branch and Bound Method for Stochastic Global Optimization.\u201d Mathematical Programming 83, 425\u2013450.","journal-title":"Mathematical Programming"},{"key":"3967_CR20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"J.H. Owen","year":"2001","unstructured":"Owen, J.H. and Mehrotra, S. (2001). \u201cA Disjunctive Cutting Plane Procedure for General Mixed-Integer Linear Programs.\u201d Math. Progr. 89, 437\u2013448.","journal-title":"Math. Progr."},{"key":"3967_CR21","first-page":"229","volume":"83","author":"R. Schultz","year":"1998","unstructured":"Schultz, R., L. Stougie, and M.H. van der Vlerk. (1998). \u201cSolving Stochastic Programs with Integer Recourse by Enumeration: A Framework Using Gr\u00f6bner Basis Reductions.\u201d Math. Progr. 83, 229\u2013252.","journal-title":"Math. Progr."},{"key":"3967_CR22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02110042","volume":"3","author":"S. Sen","year":"1994","unstructured":"Sen, S., R.D. Doverspike, and S. Cosares. (1994). \u201cNetwork Planning with Random Demand.\u201d Telecommunication Systems 3, 11\u201330.","journal-title":"Telecommunication Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3967-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3967-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3967-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T06:12:22Z","timestamp":1586585542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3967-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3967"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3967-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}