Efficient heuristic algorithms for maximum utility product pricing problems
From MaRDI portal
Publication:342312
DOI10.1016/j.cor.2015.11.013zbMath1349.90865OpenAlexW2208368999MaRDI QIDQ342312
M. A. Sharpe, Tunçel, Levent, Tor G. J. Myklebust
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.11.013
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The Envy-Free Pricing Problem and Unit-Demand Markets, Mixed-integer formulations for the capacitated rank pricing problem with envy, A survey on mixed-integer programming techniques in bilevel optimization, Pricing Toll Roads under Uncertainty, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum utility product pricing models and algorithms based on reservation price
- Valid inequalities and branch-and-cut for the clique pricing problem
- A pricing problem under Monge property
- A polyhedral study of the network pricing problem with connected toll arcs
- A Nonparametric Approach to Multiproduct Pricing
- Optimal Bundle Pricing
- The Stackelberg Minimum Spanning Tree Game
- Stackelberg Network Pricing Games
- Pricing bridges to cross a river
- Automata, Languages and Programming