A polyhedral study of the network pricing problem with connected toll arcs
From MaRDI portal
Publication:3057150
DOI10.1002/net.20368zbMath1200.90031OpenAlexW4251854703MaRDI QIDQ3057150
Martine Labbé, Géraldine Heilporn, Gilles Savard, Patrice Marcotte
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20368
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (13)
On a stochastic bilevel programming problem ⋮ The hub location and pricing problem ⋮ A Catalog of Formulations for the Network Pricing Problem ⋮ Efficient heuristic algorithms for maximum utility product pricing problems ⋮ The Envy-Free Pricing Problem and Unit-Demand Markets ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Valid inequalities and branch-and-cut for the clique pricing problem ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ Bilevel road pricing: theoretical analysis and optimality conditions ⋮ Competitive location and pricing on a line with metric transportation costs ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Maximum utility product pricing models and algorithms based on reservation price
- New formulations and valid inequalities for a bilevel pricing problem
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- An overview of bilevel optimization
- Tariff Optimization in Networks
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- An approximation algorithm for Stackelberg network pricing
This page was built for publication: A polyhedral study of the network pricing problem with connected toll arcs
