An s-t connection problem with adaptability

DOI10.1016/J.DAM.2010.12.018MaRDI QIDQ534328zbMATH OpenOpenAlexFDO

Authors 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

\(s\)-\(t\) connectivityadaptabilityrobust optimizationshortest pathtwo-stage optimization

Mathematics Subject Classification ID

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

Recommendations

• A note on connectivity of efficient solution sets
• On the parameterized complexity of dynamic problems with connectivity constraints
• scientific article; zbMATH DE number 2119687
• On the point-to-point connection problem
• On the computational difficulty of the terminal connection problem
• scientific article; zbMATH DE number 867714
• Connectedness of the solution set of the tensor complementarity problem
• scientific article; zbMATH DE number 219315
• The -connected assignment problem

Cites work

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534328)