[go: up one dir, main page]
create a website
Robust and Adaptive Network Flows. (2013). Nasrabadi, Ebrahim ; Bertsimas, Dimitris ; Stiller, Sebastian .
In: Operations Research.
RePEc:inm:oropre:v:61:y:2013:i:5:p:1218-1242.

Full description at Econpapers || Download paper

Cited: 6

Citations received by this document

Cites: 44

References cited by this document

Cocites: 50

Documents which have cited the same bibliography

Coauthors: 0

Authors who have wrote about the same topic

Citations

Citations received by this document

  1. A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. (2023). Lefebvre, Henri ; Detienne, Boris ; Clautiaux, Franois.
    In: Journal of Scheduling.
    RePEc:spr:jsched:v:26:y:2023:i:2:d:10.1007_s10951-022-00775-1.

    Full description at Econpapers || Download paper

  2. Robust building evacuation planning in a dynamic network flow model under collapsible nodes and arcs. (2023). Moon, Ilkyeong ; Shin, Youngchul.
    In: Socio-Economic Planning Sciences.
    RePEc:eee:soceps:v:86:y:2023:i:c:s0038012122002567.

    Full description at Econpapers || Download paper

  3. .

    Full description at Econpapers || Download paper

  4. Heuristic solutions to robust variants of the minimum-cost integer flow problem. (2020). Manger, Robert ; Poljarec, Marko.
    In: Journal of Heuristics.
    RePEc:spr:joheur:v:26:y:2020:i:4:d:10.1007_s10732-020-09441-1.

    Full description at Econpapers || Download paper

  5. On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems. (2019). Pavel, Lacra ; Gupta, Shuvomoy Das .
    In: Journal of Global Optimization.
    RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-019-00750-9.

    Full description at Econpapers || Download paper

  6. Designing networks with resiliency to edge failures using two-stage robust optimization. (2019). Kevrekidis, Ioannis G ; Gounaris, Chrysanthos E ; Matthews, Logan R.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:279:y:2019:i:3:p:704-720.

    Full description at Econpapers || Download paper

References

References cited by this document

  1. Ageev AA, Sviridenko MI (1999) Approximation algorithms for maximum coverage and max cut with given sizes of parts. Cornuéjols G, Burkard RE, Woeginger GJ, eds. Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 1610 (Springer-Verlag, Berlin), 17–30.
    Paper not yet in RePEc: Add citation now
  2. Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows. Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).
    Paper not yet in RePEc: Add citation now
  3. Altner DS, Ergun Ö, Uhan NA (2010) The maximum flow network interdiction problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett. 38(1):33–38.
    Paper not yet in RePEc: Add citation now
  4. Aneja YP, Nair KPK, Chandrasekaran R (2001) Maximizing residual flow under arc destruction. Networks 34(4):194–198.
    Paper not yet in RePEc: Add citation now
  5. Aronson JE (1989) A survey of dynamic network flows. Ann. Oper. Res. 20(1):1–66.
    Paper not yet in RePEc: Add citation now

  6. Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.

  7. Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.
    Paper not yet in RePEc: Add citation now

  8. Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.

  9. Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.
    Paper not yet in RePEc: Add citation now

  10. Bertsimas D, Goyal V (2010) On the power of robust solutions in two-stage stochastic and adaptive optimization problems. Math. Oper. Res. 35(2):284–305.

  11. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1):49–71.
    Paper not yet in RePEc: Add citation now

  12. Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 54(1):35–53.

  13. Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, New York).
    Paper not yet in RePEc: Add citation now
  14. Chekuri C, Shepherd FB, Oriolo G, Scutellá MG (2007) Hardness of robust network design. Networks 50(1):50–54.
    Paper not yet in RePEc: Add citation now

  15. Cormican KJ, Morton DP, Wood RK (1998) Stochastic network interdiction. Oper. Res. 46(2):184–197.

  16. Du D, Chandrasekaran R (2007) The maximum residual flow problem: NP-hardness with two-arc destruction. Networks 50(3):181–182.
    Paper not yet in RePEc: Add citation now
  17. El-Ghaoui L, Lebret H (1997) Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18(4):1035–1064.
    Paper not yet in RePEc: Add citation now
  18. El-Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1):33–52.
    Paper not yet in RePEc: Add citation now
  19. Eppstein D (1992) Parallel recognition of series-parallel graphs. Inform. Comput. 98(1):41–55.
    Paper not yet in RePEc: Add citation now

  20. Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.

  21. Ford LR, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).
    Paper not yet in RePEc: Add citation now

  22. Frenk JBG, Kassay G, Kolumbán J (2004) On equivalent results in minimax theory. Eur. J. Oper. Res. 157(1):46–58.

  23. Garg N, Vazirani VV (1995) A polyhedron with all s-t cuts as vertices, and adjacency of cuts. Math. Programming 70(1):17–25.
    Paper not yet in RePEc: Add citation now
  24. Grötschel M, Lovász L, Schrijver A (1988) Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, Vol. 2 (Springer, Berlin).
    Paper not yet in RePEc: Add citation now
  25. Hochbaum DS (1997) Approximating covering and packing problems. Approximation Algorithms for NP-Hard Problems (PWS Publishing Co., Boston), 94–143.
    Paper not yet in RePEc: Add citation now
  26. Jensen PA, Bard JF (2003) Operations Research—Models and Methods (John Wiley & Sons, Hoboken, NJ).
    Paper not yet in RePEc: Add citation now

  27. Klingman D, Napier AA, Stutz J (1974) NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Management Sci. 20(5):814–821.

  28. Liebchen C, Lübbecke ME, Möhring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Ahuja RK, Möhring RH, Zaroliagis C, eds. Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, Vol. 5868 (Springer-Verlag, Berlin), 1–27.
    Paper not yet in RePEc: Add citation now

  29. Mattia S (2013) The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3):619–643.

  30. Melkonian V (2007) Flows in dynamic networks with aggregate arc capacities. Inform. Processing Lett. 101(1):30–35.
    Paper not yet in RePEc: Add citation now
  31. Minoux M (2009) On robust maximum flow with polyhedral uncertainty sets. Optim. Lett. 3(3):367–376.
    Paper not yet in RePEc: Add citation now
  32. Ordóñez F, Zhao J (2007) Robust capacity expansion of network flows. Networks 50(2):136–145.
    Paper not yet in RePEc: Add citation now
  33. Pardalos PM, Rosen JB (1987) Constrained Global Optimization: Algorithms and Applications (Springer-Verlag, Berlin).
    Paper not yet in RePEc: Add citation now
  34. Poss Mi, Raack C (2011) Affine recourse for the robust network design problem: Between static and dynamic routing. Proc. 5th Internat. Conf. Network Optim. INOC'11 (Springer-Verlag, Berlin), 150–155.
    Paper not yet in RePEc: Add citation now
  35. Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Routing. Handbooks in Operations Research and Management Science (North-Holland, Amsterdam), 141–295.
    Paper not yet in RePEc: Add citation now

  36. Royset JO, Wood RK (2007) Solving the bi-objective maximum-flow network-interdiction problem. INFORMS J. Comput. 19(2):175–184.

  37. Skutella M (2009) An introduction to network flows over time. Cook W, Lovász L, Vygen J, eds. Research Trends in Combinatorial Optimization (Springer, Berlin), 451–482.
    Paper not yet in RePEc: Add citation now
  38. Wald A (1945) Statistical decision functions which minimize the maximum risk. Ann. Math. 46(2):46–58.
    Paper not yet in RePEc: Add citation now

  39. Washburn A, Wood RK (1995) Two-person zero-sum games for network interdiction. Oper. Res. 43(2):243–251.

  40. Williamson DP (2004) Lecture notes on network flow. Technical report 1460, Cornell University, Ithaca, NY.
    Paper not yet in RePEc: Add citation now

  41. Wollmer R (1964) Removing arcs from a network. Transportation Res. B 12(6):934–940.

  42. Wood RK (1993) Deterministic network interdiction. Math. Comput. Model. 17(2):1–18.
    Paper not yet in RePEc: Add citation now
  43. Ye Y (1992) On affine scaling algorithms for nonconvex quadratic programming. Math. Programming 56(3):285–300.
    Paper not yet in RePEc: Add citation now
  44. Zenklusen R (2012) A short note on the NP-completeness of node-wise limited matching interdiction. Technical report, Institute for Operations Research, ETH Zurich, Zurich.
    Paper not yet in RePEc: Add citation now

Cocites

Documents in RePEc which have cited the same bibliography

  1. Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization. (2021). Postek, Krzysztof ; Romeijnders, Ward.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:33:y:2021:i:1:p:390-400.

    Full description at Econpapers || Download paper

  2. Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties. (2021). Ding, Xiaodong ; Luo, Hezhi ; Li, Duan ; Jiang, Rujun ; Peng, Jiming.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:33:y:2021:i:1:p:180-197.

    Full description at Econpapers || Download paper

  3. Locating facilities with resiliency to capacity failures and correlated demand uncertainty. (2021). Cheng, Chun ; Lu, Xiaohan.
    In: Transportation Research Part E: Logistics and Transportation Review.
    RePEc:eee:transe:v:153:y:2021:i:c:s1366554521002088.

    Full description at Econpapers || Download paper

  4. Target-oriented robust location–transportation problem with service-level measure. (2021). Zhang, Lianmin ; Shen, Houcai ; Kuo, Yong-Hong ; Wang, Xin.
    In: Transportation Research Part B: Methodological.
    RePEc:eee:transb:v:153:y:2021:i:c:p:1-20.

    Full description at Econpapers || Download paper

  5. Robust facility location under demand uncertainty and facility disruptions. (2021). Rousseau, Louis-Martin ; Adulyasak, Yossiri ; Cheng, Chun.
    In: Omega.
    RePEc:eee:jomega:v:103:y:2021:i:c:s0305048321000384.

    Full description at Econpapers || Download paper

  6. A Review of Flexible Processes and Operations. (2021). Zhang, Jia Wei ; Wang, Xuan.
    In: Production and Operations Management.
    RePEc:bla:popmgt:v:30:y:2021:i:6:p:1804-1824.

    Full description at Econpapers || Download paper

  7. Optimal Global Liner Service Procurement by Utilizing Liner Service Schedules. (2021). Shu, Shengnan ; Lee, Chungyee ; Xu, Zhou.
    In: Production and Operations Management.
    RePEc:bla:popmgt:v:30:y:2021:i:3:p:703-714.

    Full description at Econpapers || Download paper

  8. Heuristic solutions to robust variants of the minimum-cost integer flow problem. (2020). Manger, Robert ; Poljarec, Marko.
    In: Journal of Heuristics.
    RePEc:spr:joheur:v:26:y:2020:i:4:d:10.1007_s10732-020-09441-1.

    Full description at Econpapers || Download paper

  9. A two-stage robust optimization approach for the berth allocation problem under uncertainty. (2020). Liu, Changchun ; Zheng, LI ; Xiang, XI.
    In: Flexible Services and Manufacturing Journal.
    RePEc:spr:flsman:v:32:y:2020:i:2:d:10.1007_s10696-019-09343-w.

    Full description at Econpapers || Download paper

  10. Oracle-based algorithms for binary two-stage robust optimization. (2020). Kurtz, Jannis ; Kammerling, Nicolas.
    In: Computational Optimization and Applications.
    RePEc:spr:coopap:v:77:y:2020:i:2:d:10.1007_s10589-020-00207-w.

    Full description at Econpapers || Download paper

  11. A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization. (2020). Wiesemann, Wolfram ; Tsoukalas, Angelos ; Georghiou, Angelos.
    In: Operations Research.
    RePEc:inm:oropre:v:68:y:2020:i:2:p:572-590.

    Full description at Econpapers || Download paper

  12. Robust optimization for hurricane preparedness. (2020). Paul, Jomon A ; Wang, Xinfang.
    In: International Journal of Production Economics.
    RePEc:eee:proeco:v:221:y:2020:i:c:s0925527319302749.

    Full description at Econpapers || Download paper

  13. An integrated planning model in centralized power systems. (2020). Sayed, Mohamed H ; Nasini, Stefano ; Lopez-Ramos, Francisco.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:287:y:2020:i:1:p:361-377.

    Full description at Econpapers || Download paper

  14. The decision rule approach to optimization under uncertainty: methodology and applications. (2019). Wiesemann, Wolfram ; Kuhn, Daniel ; Georghiou, Angelos.
    In: Computational Management Science.
    RePEc:spr:comgts:v:16:y:2019:i:4:d:10.1007_s10287-018-0338-5.

    Full description at Econpapers || Download paper

  15. Distributionally Robust Markovian Traffic Equilibrium. (2019). Natarajan, Karthik ; Arikan, Uur ; Ahipaaolu, Selin Damla .
    In: Transportation Science.
    RePEc:inm:ortrsc:v:53:y:2019:i:6:p:1546-1562.

    Full description at Econpapers || Download paper

  16. Designing Response Supply Chain Against Bioattacks. (2019). Zhang, Peter Yun ; Trichakis, Nikolaos ; Simchi-Levi, David.
    In: Operations Research.
    RePEc:inm:oropre:v:67:y:2019:i:5:p:1246-1268.

    Full description at Econpapers || Download paper

  17. Hinterland freight transportation replanning model under the framework of synchromodality. (2019). Tavasszy, Lorant ; Maknoon, Yousef ; Rezaei, Jafar ; Qu, Wenhua.
    In: Transportation Research Part E: Logistics and Transportation Review.
    RePEc:eee:transe:v:131:y:2019:i:c:p:308-328.

    Full description at Econpapers || Download paper

  18. Service network design considering multiple types of services. (2019). Qi, Mingyao ; Wang, Zujian.
    In: Transportation Research Part E: Logistics and Transportation Review.
    RePEc:eee:transe:v:126:y:2019:i:c:p:1-14.

    Full description at Econpapers || Download paper

  19. A robust optimization approach to multi-interval location-inventory and recharging planning for electric vehicles. (2019). Yang, Chao ; Sun, Hao.
    In: Omega.
    RePEc:eee:jomega:v:86:y:2019:i:c:p:59-75.

    Full description at Econpapers || Download paper

  20. Designing networks with resiliency to edge failures using two-stage robust optimization. (2019). Kevrekidis, Ioannis G ; Gounaris, Chrysanthos E ; Matthews, Logan R.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:279:y:2019:i:3:p:704-720.

    Full description at Econpapers || Download paper

  21. Robust combinatorial optimization under convex and discrete cost uncertainty. (2018). Kurtz, Jannis ; Buchheim, Christoph.
    In: EURO Journal on Computational Optimization.
    RePEc:spr:eurjco:v:6:y:2018:i:3:d:10.1007_s13675-018-0103-0.

    Full description at Econpapers || Download paper

  22. A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. (2018). Burer, Samuel ; Xu, Guanglin.
    In: Computational Optimization and Applications.
    RePEc:spr:coopap:v:70:y:2018:i:1:d:10.1007_s10589-017-9974-x.

    Full description at Econpapers || Download paper

  23. Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. (2018). Pasiliao, Eduardo L ; Krokhmal, Pavlo ; Pajouh, Foad Mahdavi ; Rysz, Maciej.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:262:y:2018:i:1:d:10.1007_s10479-016-2212-6.

    Full description at Econpapers || Download paper

  24. Robust Optimization for a Maritime Inventory Routing Problem. (2018). Rodrigues, Filipe ; Hvattum, Lars Magnus ; Christiansen, Marielle ; Agra, Agostinho.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:52:y:2018:i:3:p:509-525.

    Full description at Econpapers || Download paper

  25. The Value of Flexibility in Robust Location–Transportation Problems. (2018). Delage, Erick ; Ardestani-Jaafari, Amir.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:52:y:2018:i:1:p:189-209.

    Full description at Econpapers || Download paper

  26. Adaptive Robust Optimization-Based Optimal Operation of Microgrids Considering Uncertainties in Arrival and Departure Times of Electric Vehicles. (2018). Kim, Hak-Man ; Hussain, Akhtar ; Choi, Se-Hyeok.
    In: Energies.
    RePEc:gam:jeners:v:11:y:2018:i:10:p:2646-:d:173590.

    Full description at Econpapers || Download paper

  27. A two-stage robust approach for the reliable logistics network design problem. (2018). Cheng, Chun ; Rousseau, Louis-Martin ; Zhang, Ying ; Qi, Mingyao .
    In: Transportation Research Part B: Methodological.
    RePEc:eee:transb:v:111:y:2018:i:c:p:185-202.

    Full description at Econpapers || Download paper

  28. A mean-risk mixed integer nonlinear program for transportation network protection. (2018). Huang, Yongxi ; Lu, Jie ; Gupte, Akshay .
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:265:y:2018:i:1:p:277-289.

    Full description at Econpapers || Download paper

  29. Robust stochastic vehicle routing and scheduling for bushfire emergency evacuation: An Australian case study. (2017). Shahparvari, Shahrooz ; Abbasi, Babak.
    In: Transportation Research Part A: Policy and Practice.
    RePEc:eee:transa:v:104:y:2017:i:c:p:32-49.

    Full description at Econpapers || Download paper

  30. Two-stage robust optimization approach to elective surgery and downstream capacity planning. (2017). Neyshabouri, Saba ; Berg, Bjorn P.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:260:y:2017:i:1:p:21-40.

    Full description at Econpapers || Download paper

  31. The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. (2016). Solyali, Ouz ; Laporte, Gilbert ; Cordeau, Jean-Franois.
    In: Management Science.
    RePEc:inm:ormnsc:v:62:y:2016:i:4:p:1188-1201.

    Full description at Econpapers || Download paper

  32. Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds. (2016). Bertsimas, Dimitris.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:28:y:2016:i:3:p:500-511.

    Full description at Econpapers || Download paper

  33. Attainability in Repeated Games with Vector Payoffs. (2015). Venel, Xavier ; Solan, Eilon ; Bauso, Dario ; Lehrer, Ehud.
    In: Mathematics of Operations Research.
    RePEc:inm:ormoor:v:40:y:2015:i:3:p:739-755.

    Full description at Econpapers || Download paper

  34. USG Uses Stochastic Optimization to Lower Distribution Costs. (2015). David, Amy ; Diwekar, Urmila ; Januszyk, Ross ; Farr, David .
    In: Interfaces.
    RePEc:inm:orinte:v:45:y:2015:i:3:p:216-227.

    Full description at Econpapers || Download paper

  35. The Recoverable Robust Two-Level Network Design Problem. (2015). Alvarez-Miranda, Eduardo ; Raghavan, S ; Ljubi, Ivana ; Toth, Paolo.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:27:y:2015:i:1:p:1-19.

    Full description at Econpapers || Download paper

  36. On risk-averse maximum weighted subgraph problems. (2014). Rysz, Maciej ; Pasiliao, Eduardo L ; Krokhmal, Pavlo ; Mirghorbani, Mohammad.
    In: Journal of Combinatorial Optimization.
    RePEc:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-014-9718-0.

    Full description at Econpapers || Download paper

  37. Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results. (2014). Shu, Jia ; Song, Miao .
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:26:y:2014:i:1:p:135-149.

    Full description at Econpapers || Download paper

  38. Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. (2013). Sorokin, Alexey ; Pardalos, Panos M ; Nahapetyan, Artyom ; Boginski, Vladimir.
    In: Journal of Combinatorial Optimization.
    RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9422-2.

    Full description at Econpapers || Download paper

  39. New models for the robust shortest path problem: complexity, resolution and generalization. (2013). Wu, Lei ; Murat, Cecile ; Gabrel, Virginie.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:207:y:2013:i:1:p:97-120:10.1007/s10479-011-1004-2.

    Full description at Econpapers || Download paper

  40. Robust delay-constrained routing in telecommunications. (2013). Ouorou, Adam ; Bonami, Pierre ; Hijazi, Hassan.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:206:y:2013:i:1:p:163-181:10.1007/s10479-013-1371-y.

    Full description at Econpapers || Download paper

  41. Robust and Adaptive Network Flows. (2013). Nasrabadi, Ebrahim ; Bertsimas, Dimitris ; Stiller, Sebastian .
    In: Operations Research.
    RePEc:inm:oropre:v:61:y:2013:i:5:p:1218-1242.

    Full description at Econpapers || Download paper

  42. Multi-service multi-facility network design under uncertainty. (2012). MacUlan, Nelson ; Lisser, Abdel ; Andrade, Rafael .
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:199:y:2012:i:1:p:157-178:10.1007/s10479-011-1003-3.

    Full description at Econpapers || Download paper

  43. Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems. (2011). Altner, Douglas ; Ergun, Ozlem.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:184:y:2011:i:1:p:3-26:10.1007/s10479-010-0730-1.

    Full description at Econpapers || Download paper

  44. The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. (2011). Altin, Ayegul ; Pinar, Mustafa ; Yaman, Hande.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:23:y:2011:i:1:p:75-89.

    Full description at Econpapers || Download paper

  45. Average Flow Constraints and Stabilizability in Uncertain Production-Distribution Systems. (2010). Pesenti, Raffaele ; Blanchini, F ; Bauso, D.
    In: Journal of Optimization Theory and Applications.
    RePEc:spr:joptap:v:144:y:2010:i:1:d:10.1007_s10957-009-9593-5.

    Full description at Econpapers || Download paper

  46. Wardrop Equilibria with Risk-Averse Users. (2010). Ordoez, Fernando ; Stier-Moses, Nicolas E.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:44:y:2010:i:1:p:63-86.

    Full description at Econpapers || Download paper

  47. Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts. (2009). Chen, Xin ; Zhang, Yuhan .
    In: Operations Research.
    RePEc:inm:oropre:v:57:y:2009:i:6:p:1469-1482.

    Full description at Econpapers || Download paper

  48. Robust Optimization for Empty Repositioning Problems. (2009). Savelsbergh, Martin ; Erera, Alan L ; Morales, Juan C.
    In: Operations Research.
    RePEc:inm:oropre:v:57:y:2009:i:2:p:468-483.

    Full description at Econpapers || Download paper

  49. A Linear Decision-Based Approximation Approach to Stochastic Programming. (2008). Sim, Melvyn ; Chen, Xin ; Zhang, Jiawei ; Sun, Peng.
    In: Operations Research.
    RePEc:inm:oropre:v:56:y:2008:i:2:p:344-357.

    Full description at Econpapers || Download paper

  50. The Flow Set with Partial Order. (2008). Atamturk, Alper ; Zhang, Muhong .
    In: Mathematics of Operations Research.
    RePEc:inm:ormoor:v:33:y:2008:i:3:p:730-746.

    Full description at Econpapers || Download paper

Coauthors

Authors registered in RePEc who have wrote about the same topic

Report date: 2024-12-22 11:28:14 || Missing content? Let us know

CitEc is a RePEc service, providing citation data for Economics since 2001. Sponsored by INOMICS. Last updated October, 6 2023. Contact: CitEc Team.