An \(s\)-\(t\) connection problem with adaptability

DOI10.1016/j.dam.2010.12.018zbMath1220.90145OpenAlexW2056325851MaRDI QIDQ534328

David Adjiashvili, Rico Zenklusen

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.018

zbMATH Keywords

shortest pathrobust optimization\(s\)-\(t\) connectivityadaptabilitytwo-stage optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (5)

Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ How to Secure Matchings against Edge Failures ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ Bulk-robust combinatorial optimization ⋮ How to Secure Matchings Against Edge Failures

Cites Work

• Unnamed Item
• The computational complexity of the relative robust shortest path problem with interval data
• Most vital links and nodes in weighted networks
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• Robust discrete optimization and network flows
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• Two-Stage Robust Network Design with Exponential Scenarios
• The Exact Subgraph Recoverable Robust Shortest Path Problem
• Robust Combinatorial Optimization with Exponential Scenarios
• Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
• Algorithms – ESA 2005

This page was built for publication: An \(s\)-\(t\) connection problem with adaptability