Product line pricing for services with capacity constraints and dynamic substitution

DOI10.1016/j.ejor.2011.12.026zbMath1244.90169MaRDI 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

heuristics; branch and bound; pricing; mixed-integer programming

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B50: Management decision making, including multiple objectives

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• Tabu search