Cover Image

On the Complexity of the Bilevel Shortest Path Problem

Fuente: Wiley Open Access

Saved in:

Bibliographic Details
Main Authors:	Dorothee Henke, Lasse Wulf
Format:	Artículo Open Access
Published:	Wiley 2025
Subjects:	Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Complexity of the Bilevel Shortest Path Problem
by: Henke, Dorothee, et al.
Published: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

The Complexity of Stackelberg Pricing Games
by: Grüne, Christoph, et al.
Published: (2025)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
by: Grüne, Christoph, et al.
Published: (2023)

An FPTAS for Shortest-Longest Path Problem
by: Zhang, Jianwei
Published: (2024)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
by: Ahrens, Markus, et al.
Published: (2021)

Precedence‐Constrained Shortest Path
by: Christina Büsing, et al.
Published: (2025)

Shortest Path Problem with Subnormal Gaussian Fuzzy Costs
by: Akdemir, Hande Günay, et al.
Published: (2026)

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
by: Marcel Jackiewicz, et al.
Published: (2024)

On Coupling Constraints in Linear Bilevel Optimization
by: Henke, Dorothee, et al.
Published: (2024)

On Coupling Constraints in Pessimistic Linear Bilevel Optimization
by: Henke, Dorothee, et al.
Published: (2025)

Defense Against Shortest Path Attacks
by: Miller, Benjamin A., et al.
Published: (2023)

Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
by: Zhu, Alan, et al.
Published: (2025)

The Complexity of Blocking All Solutions
by: Grüne, Christoph, et al.
Published: (2025)

Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
by: Chen, Yung-Fu, et al.
Published: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
by: Grüne, Christoph, et al.
Published: (2024)

QR-MO: Q-Routing for Multi-Objective Shortest-Path Computation in 5G-MEC Systems
by: Sarah, Annisa, et al.
Published: (2025)

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
by: Jackiewicz, Marcel, et al.
Published: (2024)

Bridging Local and Global Knowledge: Cascaded Mixture-of-Experts Learning for Near-Shortest Path Routing
by: Chen, Yung-Fu, et al.
Published: (2026)

Service Function Chain Routing in LEO Networks Using Shortest-Path Delay Statistical Stability
by: Zeng, Li, et al.
Published: (2026)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

The Steiner Shortest Path Tree Problem
by: Asher, Omer, et al.
Published: (2025)

Multiagent Stochastic Shortest Path Problem
by: Jonáš, Martin, et al.
Published: (2026)

Designing Capacitated Subnetworks for Shortest Path Routing
by: Chimani, Markus, et al.
Published: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Nour ElHouda Tellache, et al.
Published: (2025)

On Computing Top-$k$ Simple Shortest Paths from a Single Source
by: D'Emidio, Mattia, et al.
Published: (2025)

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
by: Moon, Kyungduk, et al.
Published: (2026)

The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)

Unsupervised Learning for the Elementary Shortest Path Problem
by: Chen, Jingyi, et al.
Published: (2025)

Stochastic Shortest Path Problem with Failure Probability
by: Otsubo, Ritsusamuel
Published: (2024)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
by: Funayama, Ryo, et al.
Published: (2024)

On the Exact Matching Problem in Dense Graphs
by: Maalouly, Nicolas El, et al.
Published: (2024)

Solving Constrained Stochastic Shortest Path Problems with Scalarisation
by: Schmalz, Johannes, et al.
Published: (2025)

Efficient Constraint Generation for Stochastic Shortest Path Problems
by: Schmalz, Johannes, et al.
Published: (2026)

Generalization in LLM Problem Solving: The Case of the Shortest Path
by: Tong, Yao, et al.
Published: (2026)

Efficient Constraint Generation for Stochastic Shortest Path Problems
by: Schmalz, Johannes, et al.
Published: (2024)

Monotone Causality in Opportunistically Stochastic Shortest Path Problems
by: Gaspard, Mallory E., et al.
Published: (2023)