On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271): Difference between revisions

@@ 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.orl.2006.09.007
+Normal rank
@@ Property / OpenAlex ID @@
+W1988146710
@@ Property / OpenAlex ID: W1988146710 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem in series -- parallel multidigraphs with interval data
+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 @@
+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 Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank