Product line pricing for services with capacity constraints and dynamic substitution

DOI10.1016/j.ejor.2011.12.026zbMath1244.90169OpenAlexW1988820720MaRDI QIDQ439681

J. Herrera, H. S. Yoon

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.026

zbMATH Keywords

heuristicsbranch and boundpricingmixed-integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A classification of the literature on the planning of substitutable products, Optimal product line pricing in the presence of budget-constrained consumers, Optimizing assortment and pricing of multiple retail categories with cross-selling, Manufacturer's product line selling strategy and add-on policy in product sharing, Joint decisions on product line selection, purchasing, and pricing, Dynamic capacity allocation for group bookings in live entertainment

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Maximum utility product pricing models and algorithms based on reservation price
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
• Variable neighborhood search
• Product line selection and pricing under a share-of-surplus choice model.
• Variable neighborhood tabu search and its application to the median cycle problem.
• The theory and practice of revenue management
• Profitability in product line pricing and composition with manufacturing commonalities
• Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
• Optimizing Multinomial Logit Profit Functions
• Variable Neighborhood Search