Imagen de Portada

On the Complexity of the Bilevel Shortest Path Problem

Fuente: Wiley Open Access

Guardado en:

Detalles Bibliográficos
Autores principales:	Dorothee Henke, Lasse Wulf
Formato:	Artículo Open Access
Publicado:	Wiley 2025
Materias:	Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

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

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

An FPTAS for Shortest-Longest Path Problem
por: Zhang, Jianwei
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stochastic Shortest Path Problem with Failure Probability
por: Otsubo, Ritsusamuel
Publicado: (2024)

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

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

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

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

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

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

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

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