On exact solutions for the minmax regret spanning tree problem
From MaRDI portal
Publication:337033
DOI10.1016/j.cor.2014.02.007zbMath1348.90603OpenAlexW2011416101MaRDI QIDQ337033
Alfredo Candia-Véjar, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Paolo Toth
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/129319
minmax regretrobust optimizationminimum spanning treebranch-and-cutinterval uncertaintybenders decomposition
Related Items (7)
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ The Benders decomposition algorithm: a literature review ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems ⋮ Robust discrete spanning tree problem: local search algorithms
Uses Software
Cites Work
- Unnamed Item
- The robust set covering problem with interval data
- Exact and heuristic algorithms for the interval data robust assignment problem
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- On the complexity of the robust spanning tree problem with interval data
- Interval data minmax regret network optimization problems
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A note on the selection of Benders' cuts
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Solving Steiner tree problems in graphs to optimality
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- The robust spanning tree problem with interval data
This page was built for publication: On exact solutions for the minmax regret spanning tree problem