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

DOI10.1016/j.cor.2021.105664OpenAlexW4200627903MaRDI QIDQ2669780

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

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

integer programmingcombinatorial optimizationbilevel programmingvalid inequalityrank pricing problemranking-based consumer models

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Dynamically second-preferred \(p\)-center problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Efficient heuristic algorithms for maximum utility product pricing problems
• Maximum utility product pricing models and algorithms based on reservation price
• Hard variants of stable marriage.
• 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
• The theory and practice of revenue management
• The rank pricing problem with ties
• A Nonparametric Approach to Multiproduct Pricing
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Exact First-Choice Product Line Optimization
• Algorithmics of Matching Under Preferences
• Automata, Languages and Programming
• College Admissions and the Stability of Marriage

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