"Computational complexity of the recoverable robust shortest path problem ..."

Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski (2025)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2025.03.004

access: closed

type: Journal Article

metadata version: 2025-05-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/JackiewiczKZ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/JackiewiczKZ25
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Computational complexity of the recoverable robust shortest path problem with discrete recourse. Discret. Appl. Math. 370: 103-110 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.