The rank pricing problem with ties
DOI10.1016/J.EJOR.2021.02.017zbMATH Open1487.91042OpenAlexW3041744330MaRDI QIDQ2239986FDOQ2239986
Authors: Concepción Domínguez, Martine Labbé, Alfredo Marín 
Publication date: 5 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02889288/file/RPPT-final.pdf
Recommendations
- The rank pricing problem: models and branch-and-cut algorithms
- Mixed-integer formulations for the capacitated rank pricing problem with envy
- Bilevel programming and price setting problems
- Bilevel programming and price setting problems
- New formulations and valid inequalities for a bilevel pricing problem
combinatorial optimizationinteger programmingbilevel programmingBenders decompositionpricing problems
Combinatorial optimization (90C27) Integer programming (90C10) Microeconomic theory (price theory and economic markets) (91B24)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A strengthened formulation for the simple plant location problem with order
- Closest assignment constraints in discrete location problems
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Linear programming brings marital bliss
- Product line selection and pricing under a share-of-surplus choice model.
- Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis
- A Nonparametric Approach to Multiproduct Pricing
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- On the optimal product line selection problem with price discrimination
- On the product line selection problem under attraction choice models of consumer behavior
- Automata, Languages and Programming
- Characterization of stable matchings as extreme points of a polytope
- Optimizing product line designs: efficient methods and comparisons
- Mathematical models for stable matching problems with ties and incomplete lists
- 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
- Buying cheap is expensive: approximability of combinatorial pricing problems
Cited In (3)
This page was built for publication: The rank pricing problem with ties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239986)
