Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions

@@ Property / author @@
-Eduardo Conde
@@ Property / author: Eduardo Conde / rank @@
-Normal rank
@@ Property / author @@
+Eduardo Conde
@@ Property / author: Eduardo Conde / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2006.07.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2091418817
@@ Property / OpenAlex ID: W2091418817 / rank @@
+Normal rank
@@ Property / cites work @@
+On dual based lower bounds for the sequential ordering problem with precedences and due dates
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Complexity of robust single facility location problems on networks with uncertain edge lengths.
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+An SST-based algorithm for the steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Supermodular games and potential games.
@@ Property / cites work: Supermodular games and potential games. / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding optimum branchings
@@ Property / cites work: A note on finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+An additive bounding procedure for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Q3751390
@@ Property / cites work: Q3751390 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Bayesian networks: The combination of knowledge and statistical data
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A hop constrained min-sum arborescence with outage costs
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for DNA sequence assembly
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Q4519136
@@ Property / cites work: Q4519136 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank