Approximating optimization problems in graphs with locational uncertainty
From MaRDI portal
Cites work
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges
- Algorithms – ESA 2005
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Approximation algorithms for reliable stochastic combinatorial optimization
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Complexity and approximability of extended spanning star forest problems in general and complete graphs
- Lagrangean decomposition for mean-variance combinatorial optimization
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Optimization Problems in Graphs with Locational Uncertainty
- Optimization over integers with robustness in cost and few constraints
- Ptolemy's Inequality and the Chordal Metric
- Rapid transit network design for optimal cost and origin-destination demand capture
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust combinatorial optimization with knapsack uncertainty
- Robust discrete optimization and network flows
- TSP with locational uncertainty: the adversarial model
- The Price of Robustness
- The robust spanning tree problem with interval data
This page was built for publication: Approximating optimization problems in graphs with locational uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986979)
