Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-009-9247-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2021221063
@@ Property / OpenAlex ID: W2021221063 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust optimization - a comprehensive survey
@@ Property / cites work: Robust optimization - a comprehensive survey / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+Q2917368
@@ Property / cites work: Q2917368 / rank @@
+Normal rank
@@ Property / cites work @@
+Delay Management Problem: Complexity Results and Robust Algorithms
+Normal rank
@@ Property / cites work @@
+Optimization models for the single delay management problem in public transportation
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank