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

DOI10.1016/J.DISOPT.2011.01.001MaRDI QIDQ665989zbMATH OpenOpenAlexFDO

Authors Géraldine Heilporn, Martine Labbé, P. Marcotte, Gilles Savard

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

cliquecombinatorial optimizationmixed integer programmingnetwork pricing

Mathematics Subject Classification ID

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

Recommendations

• New formulations and valid inequalities for a bilevel pricing problem
• A polyhedral study of the network pricing problem with connected toll arcs
• Combinatorial Benders cuts for the minimum tollbooth problem
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case

Cites work

• A bilevel model of taxation and its application to optimal highway pricing
• A polyhedral study of the network pricing problem with connected toll arcs
• An approximation algorithm for Stackelberg network pricing
• Approximation and Online Algorithms
• Joint Design and Pricing on a Network
• Maximum utility product pricing models and algorithms based on reservation price
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Tariff optimization in networks

Cited in

(10)

• 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
• A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
• A polyhedral study of the network pricing problem with connected toll arcs
• Efficient heuristic algorithms for maximum utility product pricing problems
• 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
• New formulations and valid inequalities for a bilevel pricing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665989)