An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.11.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2051407192
@@ Property / OpenAlex ID: W2051407192 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+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 @@
+An exact algorithm for the robust shortest path 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 @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+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