On exact solutions for the minmax regret spanning tree problem

DOI10.1016/J.COR.2014.02.007zbMATH Open1348.90603OpenAlexW2011416101MaRDI QIDQ337033FDOQ337033

Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Francisco Pérez-Galarce, 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)

Cites Work

• Title not available (Why is that?)
• Solving Steiner tree problems in graphs to optimality
• A note on the selection of Benders' cuts
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Interval data minmax regret network optimization problems
• The robust shortest path problem with interval data via Benders decomposition
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Minmax regret combinatorial optimization problems: an Algorithmic Perspective
• The robust spanning tree problem with interval data
• On the complexity of the robust spanning tree problem with interval data
• 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
• A Benders decomposition approach for the robust spanning tree problem with interval data
• 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

Cited In (7)

• 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
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• Approximate cutting plane approaches for exact solutions to robust optimization problems
• Robust discrete spanning tree problem: local search algorithms
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming

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)