Asymmetry in the complexity of the multi-commodity network pricing problem
From MaRDI portal
Publication:6634531
DOI10.1007/s10107-023-02043-2MaRDI QIDQ6634531
José Neto, Q. M. Bui, Margarida Carvalho
Publication date: 7 November 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- An exact algorithm for the network pricing problem
- New formulations and valid inequalities for a bilevel pricing problem
- Covering graphs with few complete bipartite subgraphs
- A tabu search algorithm for the network pricing problem
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Tariff Optimization in Networks
- Path-based formulations of a bilevel toll setting problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- A Catalog of Formulations for the Network Pricing Problem
- An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
- An approximation algorithm for Stackelberg network pricing
- Convex Analysis
This page was built for publication: Asymmetry in the complexity of the multi-commodity network pricing problem
