Bulk-robust combinatorial optimization
From MaRDI portal
Publication:2515045
DOI10.1007/s10107-014-0760-6zbMath1307.90148MaRDI QIDQ2515045
Sebastian Stiller, Rico Zenklusen, David Adjiashvili
Publication date: 9 February 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/332688/files/10107_2014_Article_760.pdf
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05B35: Combinatorial aspects of matroids and geometric lattices
68W25: Approximation algorithms
Related Items
Flexible Graph Connectivity, How to Secure Matchings against Edge Failures, How to Secure Matchings Against Edge Failures, A generic optimization framework for resilient systems, Robust combinatorial optimization under convex and discrete cost uncertainty, Robust combinatorial optimization under budgeted-ellipsoidal uncertainty, Oracle-based algorithms for binary two-stage robust optimization, Decision space robustness for multi-objective integer linear programming, Flexible graph connectivity, A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches to multi-objective optimization
- An \(s\)-\(t\) connection problem with adaptability
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Matching interdiction
- Reduction approaches for robust shortest path problems
- A tight bound on the collection of edges in MSTs of induced subgraphs
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- 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)
- Design networks with bounded pairwise distance
- Approximating the smallest k -edge connected spanning subgraph by LP-rounding
- Theory and Applications of Robust Optimization
- A threshold of ln n for approximating set cover
- Two-Stage Robust Network Design with Exponential Scenarios
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- Shortest-path network interdiction
- The constrained minimum spanning tree problem
- Many birds with one stone
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Robust Combinatorial Optimization with Exponential Scenarios
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
- A Unified Continuous Greedy Algorithm for Submodular Maximization
