Approximation algorithms for the transportation problem with market choice and related models |
| |
| Authors: | Karen Aardal Pierre Le Bodic |
| |
| Affiliation: | 1. Delft Institute of Applied Mathematics, TU Delft, The Netherlands;2. Centrum Wiskunde en Informatica, Amsterdam, The Netherlands;3. H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, NW, Atlanta, GA 30332-0205, United States |
| |
| Abstract: | Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. |
| |
| Keywords: | Approximation algorithms Transportation problem with market choice Capacitated facility location |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
