The bottleneck problem with minimum quantity commitments

Naval Research Logistics

Volumn 53, Issue 1, 2006, Pages 91-100

  Lim, Andrew ^a   Xu, Zhou ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Approximate algorithm; Bottleneck problem; Minimum quantity commitment

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION;

APPROXIMATE ALGORITHMS; BOTTLENECK PROBLEM; MINIMUM QUANTITY COMMITMENT;

MARINE ENGINEERING;

EID: 33645698690     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20126     Document Type: Article

References (17)

1. J. Bar-Ilan, G. Kortsarz, and D. Peleg, How to allocate network centers, J Algor 15(3) (1993), 385-415.
2. Y. Bassok and R. Anupindi, Analysis of supply contracts with total minimum commitment, IIE Trans 29 (1997), 373-381.
3. S. Chaudhuri, N. Garg, and R. Ravi, The p-neighbor k-center problem, Inform Proc Lett 65(3) (1998), 131-134.
4. R.D. Dutton and R.C. Brigham, A characterization of competition graphs, Discrete Appl Math 6 (1983), 315-317.
5. M. Dyer and A.M. Frieze, A simple heuristic for the p-center problem, Oper Res Lett 3 (1985), 285-288.
6. J. Edmonds and D.R. Fulkerson, Bottleneck extrem, J Combinator Theor 8 (1970), 299-306.
7. M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
8. D. Hochbaum and D.B. Shmoys, A best possible heuristic for the k-center problem, Math Oper Res 10 (1985), 180-184.
9. D. Hochbaum and D.B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, J ACM 33 (1986), 533-550.
10. W. Hsu and G. Nemhauser, Easy and hard bottleneck location problems, Discrete Appl Math 1 (1979), 209-216.
11. S. Khuller, R. Pless, and Y. J. Sussmann, Fault tolerant k-center problems, Theor Comp Sci 242(1-2) (2000), 237-245.
12. S. Khuller and Y.J. Sussmann, The capacitated k-center problem, SIAM J Discrete Math 13(3) (2000), 403-418.
13. S.O. Krumke, On a generalization of the p-center problem, Inform Proc Lett 56(2) (1995), 67-71.
14. A. Lim, B. Rodrigues, F. Wang, and Z. Xu, k-center problems with minimum coverage, Theor Comput Sci 332(1-3) (2005), 1-17.
15. A. Lim and Z. Xu, The bottleneck problem with minimum quantity commitments (preliminary version), In Proceedings of the ninth Scandinavian Workshop on Algorithm Theory (SWAT), 2004, pp. 285-297.
16. J. Plesnik, A heuristic for the p-center problem in graphs, Discrete Appl Math 17 (1987), 263-268.
17. V.V. Vazirani, Approximation Algorithms, Springer-Verlag, 2001.