Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Marcel Jackiewicz
,
Adam Kasperski
,
Paweł Zieliński
Format:
Artículo Open Access
Published:
Wiley
2024
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Description
DOI:
10.1002/net.22255
Similar Items
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
by: Jackiewicz, Marcel, et al.
Published: (2024)
Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
Approximating the shortest path problem with scenarios
by: Kasperski, Adam, et al.
Published: (2018)
On the Complexity of the Bilevel Shortest Path Problem
by: Dorothee Henke, et al.
Published: (2025)
