Valid inequalities and branch-and-cut for the clique pricing problem

DOI10.1016/j.disopt.2011.01.001zbMath1233.90095OpenAlexW2090914983MaRDI 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

zbMATH Keywords

combinatorial optimizationmixed integer programmingcliquenetwork pricing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (7)

Efficient heuristic algorithms for maximum utility product pricing problems ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ 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 ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

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

This page was built for publication: Valid inequalities and branch-and-cut for the clique pricing problem