On exact solutions for the minmax regret spanning tree problem

DOI10.1016/J.COR.2014.02.007MaRDI QIDQ337033zbMATH OpenOpenAlexFDO

Authors Francisco Pérez-Galarce, Alfredo Candia-Véjar, 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

zbMATH Keywords

minimum spanning treerobust optimizationbranch-and-cutminmax regretbenders decompositioninterval uncertainty

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1779876
• Interval data minmax regret network optimization problems
• Minimax regret spanning arborescences under uncertain costs
• A branch and bound algorithm for the minimax regret spanning arborescence
• On the approximability of robust spanning tree problems

Cites work

• A Benders decomposition approach for the robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A note on the selection of Benders' cuts
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Exact and heuristic algorithms for the interval data robust assignment problem
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Interval data minmax regret network optimization problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minmax regret combinatorial optimization problems: an algorithmic perspective
• Network flows. Theory, algorithms, and applications.
• On the complexity of the robust spanning tree problem with interval data
• Solving Steiner tree problems in graphs to optimality
• The robust set covering problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• The robust spanning tree problem with interval data

Cited in

(13)

• Algorithms for the minmax regret path problem with interval data
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
• The Benders decomposition algorithm: a literature review
• Interval data minmax regret network optimization problems
• Minimax regret spanning arborescences under uncertain costs
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• A MILP-based VND for the min-max regret shortest path tree problem with interval costs
• A branch and bound algorithm for the minimax regret spanning arborescence
• scientific article; zbMATH DE number 1779876 (Why is no real title available?)
• Approximate cutting plane approaches for exact solutions to robust optimization problems
• Robust discrete spanning tree problem: local search algorithms
• Benders decomposition for the large-scale probabilistic set covering problem
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: On exact solutions for the minmax regret spanning tree problem

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