-
1
-
-
33746927109
-
Estimation of price elasticities for international telecommunications demand
-
Agiakloglou C, Yannelis D (2006) Estimation of price elasticities for international telecommunications demand. Internat. Adv. Econom. Res. 12(1):131-137.
-
(2006)
Internat. Adv. Econom. Res
, vol.12
, Issue.1
, pp. 131-137
-
-
Agiakloglou, C.1
Yannelis, D.2
-
2
-
-
79952389855
-
The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations
-
Altin A, Yaman H, Pinar MC (2011) The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1):75-89.
-
(2011)
INFORMS J. Comput
, vol.23
, Issue.1
, pp. 75-89
-
-
Altin, A.1
Yaman, H.2
Pinar, M.C.3
-
3
-
-
67349212998
-
Enhancing a branch-And-bound algorithm for two-stage stochastic integer network design-based models
-
Andrade R, Lisser A, Maculan N, Plateau G (2006) Enhancing a branch-And-bound algorithm for two-stage stochastic integer network design-based models. Management Sci. 52(9): 1450-1455.
-
(2006)
Management Sci
, vol.52
, Issue.9
, pp. 1450-1455
-
-
Andrade, R.1
Lisser, A.2
Maculan, N.3
Plateau, G.4
-
4
-
-
84887043558
-
Robust capacity expansion solutions for telecommunication networks with uncertain demands
-
Babonneau F, Klopfenstein O, Ouorou A, Vial J-P (2013) Robust capacity expansion solutions for telecommunication networks with uncertain demands. Networks 62(4):255-272.
-
(2013)
Networks
, vol.62
, Issue.4
, pp. 255-272
-
-
Babonneau, F.1
Klopfenstein, O.2
Ouorou, A.3
Vial, J.-P.4
-
6
-
-
0037797197
-
Robust solutions of uncertain quadratic and conic-quadratic problems
-
Ben-Tal A, Nemirovski A, Roos C (2002) Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J. Optim. 13(2):535-560.
-
(2002)
SIAM J. Optim
, vol.13
, Issue.2
, pp. 535-560
-
-
Ben-Tal, A.1
Nemirovski, A.2
Roos, C.3
-
7
-
-
14844327381
-
Adjustable robust solutions of uncertain linear programs
-
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351-376.
-
(2004)
Math. Programming
, vol.99
, Issue.2
, pp. 351-376
-
-
Ben-Tal, A.1
Goryashko, A.2
Guslitzer, E.3
Nemirovski, A.4
-
8
-
-
3042762207
-
The price of robustness
-
Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1): 35-53.
-
(2004)
Oper. Res
, vol.52
, Issue.1
, pp. 35-53
-
-
Bertsimas, D.1
Sim, M.2
-
9
-
-
84863393058
-
Theory and applications of robust optimization
-
Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464-501.
-
(2011)
SIAM Rev
, vol.53
, Issue.3
, pp. 464-501
-
-
Bertsimas, D.1
Brown, D.B.2
Caramanis, C.3
-
10
-
-
84947271023
-
Reformulations versus cutting planes for robust optimization: A computational and machine learning perspective
-
Bertsimas D, Dunning I, Lubin M (2015) Reformulations versus cutting planes for robust optimization: A computational and machine learning perspective. Comput. Management Sci. Forthcoming.
-
(2015)
Comput. Management Sci. Forthcoming
-
-
Bertsimas, D.1
Dunning, I.2
Lubin, M.3
-
11
-
-
0033296702
-
CSDP 2.3 users guide
-
Borchers B (1999) CSDP 2.3 users guide. Optim. Methods Software 11(1-4):597-611.
-
(1999)
Optim. Methods Software
, vol.11
, Issue.1-4
, pp. 597-611
-
-
Borchers, B.1
-
12
-
-
84947279857
-
-
CPLEX IBM ILOG CPLEX 12.4 Reference Manual (ILOG CPLEX Division, Gentilly, France
-
CPLEX (2013) IBM ILOG CPLEX 12.4 Reference Manual (ILOG CPLEX Division, Gentilly, France).
-
(2013)
-
-
-
13
-
-
28244496090
-
Benchmarking optimization software with performance profiles
-
Dolan ED, Mor JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201-213.
-
(2002)
Math. Programming
, vol.91
, Issue.2
, pp. 201-213
-
-
Dolan, E.D.1
Mor, J.J.2
-
14
-
-
84865770790
-
Cutting plane versus compact formulations for uncertain (integer) linear programs
-
Fischetti M, Monaci M (2012) Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Programming Comput. 4(3):239-273.
-
(2012)
Math. Programming Comput
, vol.4
, Issue.3
, pp. 239-273
-
-
Fischetti, M.1
Monaci, M.2
-
15
-
-
34248222509
-
Demand for telecommunication services in developing countries
-
Garbacz C, Thompson HG Jr (2007) Demand for telecommunication services in developing countries. Telecomm. Policy 315:276-289.
-
(2007)
Telecomm. Policy
, vol.315
, pp. 276-289
-
-
Garbacz, C.1
Thompson, H.G.2
-
16
-
-
84917798476
-
Stochastic programs with recourse Random recourse costs only
-
Garstka SJ (1973) Stochastic programs with recourse: Random recourse costs only. Management Sci. 19(7):747-762.
-
(1973)
Management Sci
, vol.19
, Issue.7
, pp. 747-762
-
-
Garstka, S.J.1
-
18
-
-
0001547779
-
The cutting-plane method for solving convex programs
-
Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703-712.
-
(1960)
J. Soc. Indust. Appl. Math
, vol.8
, Issue.4
, pp. 703-712
-
-
Kelley, J.E.1
-
19
-
-
84873999068
-
Robust network design: Formulations, valid inequalities, and computations
-
Koster AMCA, Kutschka M, Raack C (2013) Robust network design: Formulations, valid inequalities, and computations. Networks 61(2):128-149.
-
(2013)
Networks
, vol.61
, Issue.2
, pp. 128-149
-
-
Koster, A.M.C.A.1
Kutschka, M.2
Raack, C.3
-
20
-
-
79957464158
-
Towards a combination of interval and ellipsoid uncertainty
-
Kreinovich V, Neumaier A, Xiang G (2008) Towards a combination of interval and ellipsoid uncertainty. Comput. Technologies 13(6):5-16.
-
(2008)
Comput. Technologies
, vol.13
, Issue.6
, pp. 5-16
-
-
Kreinovich, V.1
Neumaier, A.2
Xiang, G.3
-
21
-
-
84864650151
-
Technical note: Branch-Andprice-And-cut approach to the robust network design problem without flow bifurcations
-
Lee C, Lee K, Park K, Park S (2012) Technical note: Branch-Andprice-And-cut approach to the robust network design problem without flow bifurcations. Oper. Res. 60(3):604-610.
-
(2012)
Oper. Res
, vol.60
, Issue.3
, pp. 604-610
-
-
Lee, C.1
Lee, K.2
Park, K.3
Park, S.4
-
22
-
-
77951298441
-
Robust network design in telecommunications under polytope demand uncertainty
-
Lemarchal C, Ouorou A, Petrou G (2010) Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3):634-641.
-
(2011)
Eur. J. Oper. Res
, vol.206
, Issue.3
, pp. 634-641
-
-
Lemarchal, C.1
Ouorou, A.2
Petrou, G.3
-
23
-
-
0000108196
-
Np-hardness of linear multiplicative programming and related problems
-
Matsui T (1996) Np-hardness of linear multiplicative programming and related problems. J. Global Optim. 9(2):113-119.
-
(1996)
J. Global Optim
, vol.9
, Issue.2
, pp. 113-119
-
-
Matsui, T.1
-
24
-
-
84876479742
-
The robust network loading problem with dynamic routing
-
Mattia S (2013) The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3):619-643.
-
(2013)
Comput. Optim. Appl
, vol.54
, Issue.3
, pp. 619-643
-
-
Mattia, S.1
-
25
-
-
84879042687
-
Exact solution of the robust knapsack problem
-
Monaci M, Pferschy U, Serafini P (2013) Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11):2625-2631.
-
(2013)
Comput. Oper. Res
, vol.40
, Issue.11
, pp. 2625-2631
-
-
Monaci, M.1
Pferschy, U.2
Serafini, P.3
-
26
-
-
77951243867
-
SNDlib 1.0-Survivable network design library
-
Orlowski S, Piro M, Tomaszewski A, Wessly R (2010) SNDlib 1.0-Survivable network design library. Networks 55(3):276-286.
-
(2011)
Networks
, vol.55
, Issue.3
, pp. 276-286
-
-
Orlowski, S.1
Piro, M.2
Tomaszewski, A.3
Wessly, R.4
-
27
-
-
84866181580
-
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
-
Ouorou A (2013) Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. Comput. Oper. Res. 40(1):318-327.
-
(2013)
Comput. Oper. Res
, vol.40
, Issue.1
, pp. 318-327
-
-
Ouorou, A.1
-
29
-
-
0033872128
-
A survey of algorithms for convex multicommodity flow problems
-
Ouorou A, Mahey P, Vial J-Ph (2000) A survey of algorithms for convex multicommodity flow problems. Management Sci. 46(1): 126-147.
-
(2000)
Management Sci
, vol.46
, Issue.1
, pp. 126-147
-
-
Ouorou, A.1
Mahey, P.2
Vial, J.-P.3
-
30
-
-
34548491396
-
A survey of the s-lemma
-
Plik I, Terlaky T (2007) A survey of the s-lemma. SIAM Rev. 49(3): 371-418.
-
(2007)
SIAM Rev
, vol.49
, Issue.3
, pp. 371-418
-
-
Plik, I.1
Terlaky, T.2
-
31
-
-
84874369251
-
Robust combinatorial optimization with variable budgeted uncertainty
-
Poss M (2013) Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1):75-92.
-
(2013)
4OR
, vol.11
, Issue.1
, pp. 75-92
-
-
Poss, M.1
-
32
-
-
84901626918
-
A comparison of routing sets for robust network design
-
Poss M (2014a) A comparison of routing sets for robust network design. Optim. Lett. 8(5):1619-1635.
-
(2014)
Optim. Lett
, vol.8
, Issue.5
, pp. 1619-1635
-
-
Poss, M.1
-
33
-
-
84899924780
-
Robust combinatorial optimization with variable cost uncertainty
-
Poss M (2014b) Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3):836-845.
-
(2014)
Eur. J. Oper. Res
, vol.237
, Issue.3
, pp. 836-845
-
-
Poss, M.1
-
34
-
-
84873988568
-
Affine recourse for the robust network design problem: Between static and dynamic routing
-
Poss M, Raack C (2013) Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61(2):180-198.
-
(2013)
Networks
, vol.61
, Issue.2
, pp. 180-198
-
-
Poss, M.1
Raack, C.2
|