Minimax regret spanning arborescences under uncertain costs
type: Item
instance of: scholarly article
title: Minimax regret spanning arborescences under uncertain costs
zbMATH Open document ID: 1178.90053
author: Alfredo Candia
author: E. Conde
published in: European Journal of Operational Research
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5159521
zbMATH Keywords: robust optimization
zbMATH Keywords: minimum spanning arborescences
zbMATH Keywords: Edmonds' algorithm
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.07.036
OpenAlex ID: W2091418817
cites work: On dual based lower bounds for the sequential ordering problem with precedences and due dates
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Complexity of robust single facility location problems on networks with uncertain edge lengths.
cites work: Interval data minmax regret network optimization problems
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: Supermodular games and potential games.
cites work: A note on finding optimum branchings
cites work: Q5567717
cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: Optimum branchings
cites work: An additive bounding procedure for the asymmetric travelling salesman problem
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: Q3751390
cites work: Learning Bayesian networks: The combination of knowledge and statistical data
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: A hop constrained min-sum arborescence with outage costs
cites work: Combinatorial algorithms for DNA sequence assembly
cites work: Robust discrete optimization and its applications
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: Q4519136
cites work: Finding optimum branchings
cites work: The robust spanning tree problem with interval data
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1016/J.EJOR.2006.07.036
description: scientific article; zbMATH DE number 5159521