New formulations and valid inequalities for a bilevel pricing problem
From MaRDI portal
Publication:935200
DOI10.1016/j.orl.2007.03.005zbMath1144.90323OpenAlexW2089509243MaRDI QIDQ935200
Martine Labbé, Sophie Dewez, Gilles Savard, Patrice Marcotte
Publication date: 6 August 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.03.005
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items
A new approach to solve convex infinite-dimensional bilevel problems: application to the pollution emission price problem ⋮ The hub location and pricing problem ⋮ A Catalog of Formulations for the Network Pricing Problem ⋮ Bilevel programming and applications ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Bilevel Programming: The Montreal School ⋮ Variational Methods for Emerging Real–Life and Environmental Conservation Problems ⋮ An exact algorithm for the network pricing problem ⋮ A Bilevel Programming Model for a Cohesive Decision-Making on Strategic Pricing and Production Distribution Planning for a Small-Scale Supplier ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case ⋮ Road network pricing and design for ordinary and hazmat vehicles: integrated model and specialized local search ⋮ A tabu search algorithm for the network pricing problem ⋮ Bilevel road pricing: theoretical analysis and optimality conditions ⋮ A polyhedral study of the network pricing problem with connected toll arcs ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming for price-based electricity auctions: a revenue-constrained case ⋮ Bilevel aggregator-prosumers' optimization problem in real-time: a convex optimization approach ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- A bilevel programming approach to the travelling salesman problem.
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Path-based formulations of a bilevel toll setting problem
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- An approximation algorithm for Stackelberg network pricing
- Approximation and Online Algorithms
