On exact solutions for the minmax regret spanning tree problem (Q337033): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Minmax regret combinatorial optimization problems: an Algorithmic Perspective
+Normal rank
@@ Property / cites work @@
+A note on the selection of Benders' cuts
@@ Property / cites work: A note on the selection of Benders' cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+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 @@
+Exact and heuristic algorithms for the interval data robust assignment problem
+Normal rank
@@ Property / cites work @@
+The robust set covering problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank