Recoverable robust shortest path problems

  title={Recoverable robust shortest path problems},
  author={Christina B{\"u}sing},
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second setting, we commit ourselves to a path before the costs are fully known. Deviating from this choice in… CONTINUE READING
18 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 18 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

Recoverable shortest path problems

  • C. Puhl
  • Preprint 034-2008, Institute of Mathematics…
  • 2008
1 Excerpt

Recoverable robustness

  • C. Liebchen, M. Lbbecke, R. H. Mhring, S. Stiller
  • Tech. Report ARRIVAL-TR-0066, ARRIVAL-Project,
  • 2007
1 Excerpt

Complexity of the discrete time-cost tradeoff problem for project

  • P. De, J. Dunne, Ch. Wells
  • networks. Operations Research,
  • 1997

The complexity of satisfiability problems

  • T. Schaefer
  • STOC ’78: Proceedings of the tenth annual ACM…
  • 1978

Similar Papers

Loading similar papers…