Skip to main content
SpringerLink
Log in

On robust maximum flow with polyhedral uncertainty sets

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We address the problem of determining a robust maximum flow value in a network with uncertain link capacities taken in a polyhedral uncertainty set. Besides a few polynomial cases, we focus on the case where the uncertainty set is taken to be the solution set of an associated (continuous) knapsack problem. This class of problems is shown to be polynomially solvable for planar graphs, but NP-hard for graphs without special structure. The latter result provides evidence of the fact that the problem investigated here has a structure fundamentally different from the robust network flow models proposed in various other published works.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R.K., Magnanti T., Orlin J.B.: Network Flows, Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the Min–Max (Regret) versions of cut problems. In: Proceedings of the 16th Internat. Symp. on Algorithms and Computation (ISAAC 2005). LNCS, vol. 3827, pp. 789–798 (2005)

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

    Article  MathSciNet  Google Scholar 

  4. Berge C.: Graphs and Hypergraphs. North Holland, Amsterdam (1973)

    MATH  Google Scholar 

  5. Bertsimas D., Sim M.: Robust discrete optimization and network flows. Math. Prog. B 98, 49–71 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Garey M.R., Johnson D.S.: Computers and Intractability. A Guide to the Theory of NP Completeness. W.H. Freeman and Co., San Francisco (1979)

    MATH  Google Scholar 

  8. Johnson, E.: On shortest path and sorting. In: Proc. 25th ACM Annual Conference, pp. 510–517 (1972)

  9. Minoux, M.: Duality, robustness and 2-stage robust LP decision models. Application to robust PERT scheduling. In: Robustness in OR-DA, Annnales du LAMSADE, Université Paris-Dauphine, Paris (2007)

  10. Minoux M.: Robust linear programming with right-handside uncertainty, duality and applications. In: Floudas, L.A., Pardalos, P.M.(eds) Encyclopedia of Optimization, 2nd edn., pp. 3317–3327. Springer, USA (2008)

    Google Scholar 

  11. Minoux M.: Solving some multistage robust decision problems with huge implicitely defined scenario trees. Algorithmic Oper. Res. 4(1), 1–18 (2009)

    MathSciNet  Google Scholar 

  12. Minoux, M.: On 2-stage robust LP with RHS uncertainty: complexity results and applications (2009, submitted)

Download references

Author information

Authors and Affiliations

  1. University Paris 6, 4 Place Jussieu, 75005, Paris, France

    Michel Minoux

Authors
  1. Michel Minoux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michel Minoux.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minoux, M. On robust maximum flow with polyhedral uncertainty sets. Optim Lett 3, 367–376 (2009). https://doi.org/10.1007/s11590-009-0116-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0116-y

Keywords

Search

Navigation