An \(s\)-\(t\) connection problem with adaptability (Q534328): Difference between revisions

@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The Exact Subgraph Recoverable Robust Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Combinatorial Optimization with Exponential Scenarios
+Normal rank
@@ Property / cites work @@
+Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
+Normal rank
@@ Property / cites work @@
+Two-Stage Robust Network Design with Exponential Scenarios
+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 @@
+Q4663414
@@ Property / cites work: Q4663414 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On the robust shortest path problem.
@@ Property / cites work: On the robust shortest path problem. / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank