Image de couverture de livre

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations

Fuente: Wiley Open Access

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński
Format:	Artículo Open Access
Publié:	Wiley 2024
Sujets:	Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
par: Jackiewicz, Marcel, et autres
Publié: (2024)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
par: Jackiewicz, Marcel, et autres
Publié: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

Approximating the shortest path problem with scenarios
par: Kasperski, Adam, et autres
Publié: (2018)

On the Complexity of the Bilevel Shortest Path Problem
par: Dorothee Henke, et autres
Publié: (2025)

Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging
par: Baak, Werner, et autres
Publié: (2023)

An FPTAS for Shortest-Longest Path Problem
par: Zhang, Jianwei
Publié: (2024)

An extension of Ordered Weighted Averaging over intervals with application to optimization under risk
par: Baak, Werner, et autres
Publié: (2024)

Precedence‐Constrained Shortest Path
par: Christina Büsing, et autres
Publié: (2025)

Shortest Path Problem with Subnormal Gaussian Fuzzy Costs
par: Akdemir, Hande Günay, et autres
Publié: (2026)

Defense Against Shortest Path Attacks
par: Miller, Benjamin A., et autres
Publié: (2023)

Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty
par: Goerigk, Marc, et autres
Publié: (2023)

Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
par: Zhu, Alan, et autres
Publié: (2025)

Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
par: Chen, Yung-Fu, et autres
Publié: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

QR-MO: Q-Routing for Multi-Objective Shortest-Path Computation in 5G-MEC Systems
par: Sarah, Annisa, et autres
Publié: (2025)

Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
par: Yingli Ran, et autres
Publié: (2024)

Robust Permutation Flowshops Under Budgeted Uncertainty
par: Goldberg, Noam, et autres
Publié: (2026)

V2V Path Loss Modeling at 26 GHz Based on Real-Traffic Measurements
par: Kryszkiewicz, Pawel, et autres
Publié: (2024)

Bridging Local and Global Knowledge: Cascaded Mixture-of-Experts Learning for Near-Shortest Path Routing
par: Chen, Yung-Fu, et autres
Publié: (2026)

Service Function Chain Routing in LEO Networks Using Shortest-Path Delay Statistical Stability
par: Zeng, Li, et autres
Publié: (2026)

On the Complexity of the Bilevel Shortest Path Problem
par: Henke, Dorothee, et autres
Publié: (2024)

The Steiner Shortest Path Tree Problem
par: Asher, Omer, et autres
Publié: (2025)

Multiagent Stochastic Shortest Path Problem
par: Jonáš, Martin, et autres
Publié: (2026)

Designing Capacitated Subnetworks for Shortest Path Routing
par: Chimani, Markus, et autres
Publié: (2026)

On Computing Top-$k$ Simple Shortest Paths from a Single Source
par: D'Emidio, Mattia, et autres
Publié: (2025)

Chapter The Creation of Two Ethnographic Identities: The Cases of the Ostrogoths and the Langobards
par: Kasperski, Robert
Publié: (2023)

On Incremental Approximate Shortest Paths in Directed Graphs
par: Górkiewicz, Adam, et autres
Publié: (2025)

Two-Stage Distributionally Robust Edge Node Placement Under Endogenous Demand Uncertainty
par: Cheng, Jiaming, et autres
Publié: (2024)

Stochastic Shortest Path Problem with Failure Probability
par: Otsubo, Ritsusamuel
Publié: (2024)

Unsupervised Learning for the Elementary Shortest Path Problem
par: Chen, Jingyi, et autres
Publié: (2025)

A Robust Optimization Approach for Regenerator Placement in Fault-Tolerant Networks Under Discrete Cost Uncertainty
par: Khosravi, Mohammad, et autres
Publié: (2026)

Delay-Aware Robust Edge Network Hardening Under Decision-Dependent Uncertainty
par: Cheng, Jiaming, et autres
Publié: (2024)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
par: Grüne, Christoph
Publié: (2022)

Efficient Constraint Generation for Stochastic Shortest Path Problems
par: Schmalz, Johannes, et autres
Publié: (2024)

Efficient Constraint Generation for Stochastic Shortest Path Problems
par: Schmalz, Johannes, et autres
Publié: (2026)

Generalization in LLM Problem Solving: The Case of the Shortest Path
par: Tong, Yao, et autres
Publié: (2026)

Solving Constrained Stochastic Shortest Path Problems with Scalarisation
par: Schmalz, Johannes, et autres
Publié: (2025)

Monotone Causality in Opportunistically Stochastic Shortest Path Problems
par: Gaspard, Mallory E., et autres
Publié: (2023)