Integer and combinatorial optimization
Integer and combinatorial optimization
Note on Weintraub's minimum-cost circulation algorithm
SIAM Journal on Computing
Management Science
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Nonparametric Approach to Multiproduct Pricing
Operations Research
Valid inequalities and branch-and-cut for the clique pricing problem
Discrete Optimization
Hi-index | 0.01 |
We consider a revenue management model for pricing a product line with several customer segments under the assumption that customers' product choices are determined entirely by their reservation prices. We highlight key mathematical properties of the maximum utility model and formulate it as a mixed-integer programming problem, design heuristics and valid cuts. We further present extensions of the models to deal with various practical issues arising in applications. Our computational experiments with real data from the tourism sector as well as with the randomly generated data show the effectiveness of our approach.