Highly Influenced

# Recoverable robust shortest path problems

@article{Bsing2012RecoverableRS, title={Recoverable robust shortest path problems}, author={Christina B{\"u}sing}, journal={Networks}, year={2012}, volume={59}, pages={181-189} }

- Published 2012 in Networks
DOI:10.1002/net.20487

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

#### From This Paper

##### Figures, tables, and topics from this paper.

18 Citations

9 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-9 of 9 references

Highly Influential

Highly Influential