Author:
Gan Jinxiang,Zhang Guochuan
Publisher
Springer International Publishing
Reference11 articles.
1. Anily, S., Bramel, J.: Approximation agorithms for the capacitated traveling salesman problem with pick-ups and deliveries. Naval Res. Logist. 46(6), 654–670 (1999)
2. Benchimol, M., et al.: Balancing the stations of a self service “bike hire” system. RAIRO-Oper. Res. 45(1), 37–61 (2011)
3. Bhattacharya, B., Hu, Y.: K-delivery traveling salesman problem on tree networks. In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 325–336 (2012)
4. Chalasani, P., Motwani, R.: Approximating capacitated routing and delivery problems. SIAM J. Comput. 28(6), 2133–2149 (1999)
5. Charikar, M., Khuller, S., Raghavachari, B.: Algorithms for capacitated vehicle routing. SIAM J. Comput. 31(3), 665–682 (2001)