Reduction approaches for robust shortest path problems (Q716356): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2011.01.022
@@ Property / DOI: 10.1016/j.cor.2011.01.022 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+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 @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem in series -- parallel multidigraphs 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 @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+A reduction approach to the repeated assignment problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2011.01.022
@@ Property / DOI: 10.1016/J.COR.2011.01.022 / rank @@
+Normal rank