Valid inequalities and branch-and-cut for the clique pricing problem
From MaRDI portal
Publication:665989
DOI10.1016/j.disopt.2011.01.001zbMath1233.90095MaRDI QIDQ665989
Géraldine Heilporn, Patrice Marcotte, Gilles Savard, Martine Labbé
Publication date: 7 March 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2011.01.001
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
90B20: Traffic problems in operations research
Related Items
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Bilevel programming and price setting problems, Bilevel programming and price setting problems, A survey on mixed-integer programming techniques in bilevel optimization, Efficient heuristic algorithms for maximum utility product pricing problems, The envy-free pricing problem, unit-demand markets and connections with the network pricing problem, Competitive location and pricing on a line with metric transportation costs
Cites Work
- Maximum utility product pricing models and algorithms based on reservation price
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Tariff Optimization in Networks
- A polyhedral study of the network pricing problem with connected toll arcs
- Joint Design and Pricing on a Network
- An approximation algorithm for Stackelberg network pricing
- Approximation and Online Algorithms
