The rank pricing problem: models and branch-and-cut algorithms

DOI10.1016/j.cor.2018.12.011zbMath1458.91090OpenAlexW2862500654MaRDI QIDQ1722958

Carmen Galé, Alfredo Marín, Concepción Domínguez, Martine Labbé, Herminia I. Calvete

Publication date: 19 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.12210/22829

zbMATH Keywords

integer programmingset packingbilevel programmingrank pricing problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Microeconomic theory (price theory and economic markets) (91B24)

Related Items (6)

Managing Product Transitions: A Bilevel Programming Approach ⋮ Mixed-integer formulations for the capacitated rank pricing problem with envy ⋮ Dynamically second-preferred \(p\)-center problem ⋮ The rank pricing problem with ties ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient heuristic algorithms for maximum utility product pricing problems
• Maximum utility product pricing models and algorithms based on reservation price
• A review of choice-based revenue management: theory and methods
• The complexity of optimal multidimensional pricing for a unit-demand buyer
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Linear bilevel multi-follower programming with independent followers
• A strengthened formulation for the simple plant location problem with order
• A Nonparametric Approach to Multiproduct Pricing
• Uniform Budgets and the Envy-Free Pricing Problem
• On the facial structure of set packing polyhedra
• Bilevel programming and price setting problems
• New facets for the set packing polytope

This page was built for publication: The rank pricing problem: models and branch-and-cut algorithms