Mixed-integer formulations for the capacitated rank pricing problem with envy

DOI10.1016/J.COR.2021.105664MaRDI QIDQ2669780zbMATH OpenOpenAlexFDO

Authors Concepción Domínguez, Martine Labbé, Alfredo Marín

Publication date 9 March 2022

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

Full work available at URL https://hal.inria.fr/hal-03477171/file/CRPP_REVISEDVERSION-122021.pdf

zbMATH Keywords

combinatorial optimizationinteger programmingbilevel programmingvalid inequalityrank pricing problemranking-based consumer models

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The rank pricing problem with ties
• The envy-free pricing problem and unit-demand markets
• The rank pricing problem: models and branch-and-cut algorithms
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• On profit-maximizing envy-free pricing

Cites work

• scientific article; zbMATH DE number 6383426 (Why is no real title available?)
• A Nonparametric Approach to Multiproduct Pricing
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Automata, Languages and Programming
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Buying cheap is expensive: hardness of non-parametric multi-product pricing
• College Admissions and the Stability of Marriage
• Efficient heuristic algorithms for maximum utility product pricing problems
• Exact first-choice product line optimization
• Hard variants of stable marriage.
• Maximum utility product pricing models and algorithms based on reservation price
• On profit-maximizing envy-free pricing
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• The rank pricing problem with ties
• The rank pricing problem: models and branch-and-cut algorithms
• The theory and practice of revenue management

Cited in

(5)

• The rank pricing problem: models and branch-and-cut algorithms
• The rank pricing problem with ties
• The envy-free pricing problem and unit-demand markets
• The unit-demand envy-free pricing problem applied to the sports entertainment industry
• Dynamically second-preferred \(p\)-center problem

This page was built for publication: Mixed-integer formulations for the capacitated rank pricing problem with envy

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