Abstract
In this paper, we focus on solving the share-of-choice product line problem. Previous contributions to this NP-Hard problem include a series of ever improving heuristics. We present a new algorithm that embeds a column generation procedure within branch-and-bound to obtain exact optimal integer solutions. The initial computational results using large simulated dataset demonstrate that the algorithm is capable of identifying provably optimal solutions very quickly.
| Original language | American English |
|---|---|
| State | Published - Nov 2006 |
| Event | INFORMS Annual Meeting - Phoenix, AZ Duration: Oct 14 2012 → … |
Conference
| Conference | INFORMS Annual Meeting |
|---|---|
| Period | 10/14/12 → … |
Keywords
- Algorithm
- Branch-and-price
- Heuristics
- Optimal product line
DC Disciplines
- Business