Minimax regret spanning arborescences under uncertain costs

DOI10.1016/J.EJOR.2006.07.036zbMATH Open1178.90053OpenAlexW2091418817MaRDI QIDQ881514FDOQ881514

Authors: Alfredo Candia, E. Conde 

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

Recommendations

• A branch and bound algorithm for the minimax regret spanning arborescence
• On exact solutions for the minmax regret spanning tree problem
• Interval data minmax regret network optimization problems
• scientific article; zbMATH DE number 1779876
• On the approximability of robust spanning tree problems

zbMATH Keywords

robust optimizationEdmonds' algorithmminimum spanning arborescences

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Learning Bayesian networks: The combination of knowledge and statistical data
• Robust discrete optimization and its applications
• 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
• Title not available (Why is that?)
• Interval data minmax regret network optimization problems
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• An SST-based algorithm for the steiner problem in graphs
• Supermodular games and potential games.
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Title not available (Why is that?)
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A hop constrained min-sum arborescence with outage costs
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• The computational complexity of the relative robust shortest path problem with interval data
• Combinatorial algorithms for DNA sequence assembly
• An additive bounding procedure for the asymmetric travelling salesman problem
• A note on finding optimum branchings
• Title not available (Why is that?)
• On dual based lower bounds for the sequential ordering problem with precedences and due dates

Cited In (10)

• Algorithms for the minmax regret path problem with interval data
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Robustness of minimum cost arborescences
• Maximising the worth of nascent networks
• Interval data minmax regret network optimization problems
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• On a Class of Interval Data Minmax Regret CO Problems
• On exact solutions for the minmax regret spanning tree problem
• Title not available (Why is that?)
• A branch and bound algorithm for the minimax regret spanning arborescence

This page was built for publication: Minimax regret spanning arborescences under uncertain costs

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