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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 208; no. 1-2; pp. 425 - 461
Main Authors:	Bui, Quang Minh, Carvalho, Margarida, Neto, José
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2024 Springer Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!