Bulk-robust combinatorial optimization
From MaRDI portal
Publication:2515045
Recommendations
- Non-uniform robust network design in planar graphs
- Robust combinatorial optimization with variable cost uncertainty
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- Recoverable Robust Combinatorial Optimization Problems
Cites work
- A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
- A threshold of ln n for approximating set cover
- A tight bound on the collection of edges in MSTs of induced subgraphs
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An s-t connection problem with adaptability
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- 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
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Design networks with bounded pairwise distance
- Faster replacement paths
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- Many birds with one stone
- Matching interdiction
- Maximizing submodular set functions subject to multiple linear constraints
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Multi-budgeted matchings and matroid intersection via dependent rounding
- New approaches to multi-objective optimization
- On the robust shortest path problem.
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
- Reduction approaches for robust shortest path problems
- Robust Combinatorial Optimization with Exponential Scenarios
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Shortest-path network interdiction
- Subcubic equivalences between path, matrix, and triangle problems
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- The constrained minimum spanning tree problem
- Theory and applications of robust optimization
- Two-Stage Robust Network Design with Exponential Scenarios
Cited in
(20)- 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
- Generating hard instances for robust combinatorial optimization
- scientific article; zbMATH DE number 1953193 (Why is no real title available?)
- Flexible Graph Connectivity
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- Non-uniform robust network design in planar graphs
- A generic optimization framework for resilient systems
- A (B + 1)-approximation for network flow interdiction with unit costs
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
- The robust selection problem with information discovery
- Protecting the connectivity of a graph under non-uniform edge failures
- Protecting the connectivity of a graph under nonuniform edge failures
- Fault-tolerant matroid bases
- Improved approximation algorithms for capacitated network design and flexible graph connectivity
This page was built for publication: Bulk-robust combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515045)
