Efficient heuristic algorithms for maximum utility product pricing problems

DOI10.1016/J.COR.2015.11.013MaRDI QIDQ342312zbMATH OpenOpenAlexFDO

Authors M. A. Sharpe, T. G. J. Myklebust, Levent Tunçel

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

zbMATH Keywords

algorithmsinteger programmingtotal unimodularitynetwork flow problemsoptimal product pricing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• The pricing problem. I: Exact and approximate algorithms
• Maximum utility product pricing models and algorithms based on reservation price
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Algorithms for marketing-mix optimization
• A branch-and-price approach to the share-of-choice product line design problem

Cites work

• scientific article; zbMATH DE number 6383426 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A Nonparametric Approach to Multiproduct Pricing
• A gentle introduction to optimization
• A polyhedral study of the network pricing problem with connected toll arcs
• A pricing problem under Monge property
• Automata, Languages and Programming
• Maximum utility product pricing models and algorithms based on reservation price
• On profit-maximizing envy-free pricing
• Optimal Bundle Pricing
• Pricing bridges to cross a river
• Stackelberg network pricing games
• The Stackelberg Minimum Spanning Tree Game
• Valid inequalities and branch-and-cut for the clique pricing problem

Cited in

(7)

• 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
• Automata, Languages and Programming
• 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

This page was built for publication: Efficient heuristic algorithms for maximum utility product pricing problems

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