A branch and bound algorithm for the minimax regret spanning arborescence
From MaRDI portal
Publication:878227
DOI10.1007/s10898-006-9074-4zbMath1156.90027OpenAlexW1979902175MaRDI QIDQ878227
Publication date: 26 April 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9074-4
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
Cites Work
- Unnamed Item
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Minimax regret spanning arborescences under uncertain costs
- Interval data minmax regret network optimization problems
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Optimum branchings
- The robust spanning tree problem with interval data
This page was built for publication: A branch and bound algorithm for the minimax regret spanning arborescence
