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
On the Complexity of the Bilevel Shortest Path Problem
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!
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
Internet
https://onlinelibrary.wiley.com/doi/10.1002/net.70002
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)