Mixed-integer formulations for the capacitated rank pricing problem with envy
From MaRDI portal
Publication:2669780
DOI10.1016/J.COR.2021.105664OpenAlexW4200627903MaRDI QIDQ2669780FDOQ2669780
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
Recommendations
combinatorial optimizationinteger programmingbilevel programmingvalid inequalityrank pricing problemranking-based consumer models
Cites Work
- On profit-maximizing envy-free pricing
- College Admissions and the Stability of Marriage
- The theory and practice of revenue management
- Algorithmics of Matching Under Preferences
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A Nonparametric Approach to Multiproduct Pricing
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Maximum utility product pricing models and algorithms based on reservation price
- Title not available (Why is that?)
- Efficient heuristic algorithms for maximum utility product pricing problems
- Automata, Languages and Programming
- Hard variants of stable marriage.
- Title not available (Why is that?)
- 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
- Exact First-Choice Product Line Optimization
- The rank pricing problem with ties
Cited In (1)
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)
