Minimax regret spanning arborescences under uncertain costs
From MaRDI portal
Publication:881514
DOI10.1016/j.ejor.2006.07.036zbMath1178.90053OpenAlexW2091418817MaRDI QIDQ881514
Publication date: 30 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.036
Related Items (6)
Maximising the worth of nascent networks ⋮ A branch and bound algorithm for the minimax regret spanning arborescence ⋮ 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 bottleneck problems with solution-induced interval uncertainty structure ⋮ On a Class of Interval Data Minmax Regret CO Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The computational complexity of the relative robust shortest path problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A hop constrained min-sum arborescence with outage costs
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- An additive bounding procedure for the asymmetric travelling salesman problem
- Robust discrete optimization and its applications
- Supermodular games and potential games.
- On dual based lower bounds for the sequential ordering problem with precedences and due dates
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Learning Bayesian networks: The combination of knowledge and statistical data
- Combinatorial algorithms for DNA sequence assembly
- A Benders decomposition approach for the robust spanning tree problem with interval data
- An SST-based algorithm for the steiner problem in graphs
- A note on finding optimum branchings
- Topological design of centralized computer networks—formulations and algorithms
- Finding optimum branchings
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Optimum branchings
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: Minimax regret spanning arborescences under uncertain costs
