Asymmetry in the complexity of the multi-commodity network pricing problem

The network pricing problem (NPP) is a bilevel problem, where the leader optimizes its revenue by deciding on the prices of certain arcs in a graph, while expecting the followers (also known as the commodities) to choose a shortest path based on those prices. In this paper, we investigate the comple...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming Jg. 208; H. 1-2; S. 425 - 461
Hauptverfasser:	Bui, Quang Minh, Carvalho, Margarida, Neto, José
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2024 Springer Springer Verlag
Schlagworte:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Pricing Theoretical 90C46 90C35 90C25 Network pricing problem Strong bilevel feasibility Conjugate model Complexity asymmetry
ISSN:	0025-5610, 1436-4646
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!