Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.
Retsef LeviMaxim SviridenkoPublished in: APPROX-RANDOM (2006)
Keyphrases
- improved algorithm
- computational complexity
- optimization algorithm
- error bounds
- closed form
- experimental evaluation
- polygonal approximation
- times faster
- np hard
- high accuracy
- matching algorithm
- computationally efficient
- linear programming
- clustering method
- learning algorithm
- dynamic programming
- significant improvement
- preprocessing
- k means
- approximation algorithms
- optimal solution