1 |
Reuven, B.-Y., Guy, E., and Shimon, S. (2005), On approximating a geometric prize-collecting traveling salesman problem with time windows. Journal of Algorithms, 55, 76-92.
DOI
ScienceOn
|
2 |
Solomon, M. M. (1987), Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, 35, 254-265.
DOI
ScienceOn
|
3 |
Tae, H. C., Jun, Y., and Kim, B.-I. (2010), A vehicle routing cost allocation problem with time windows, Working Paper.
|
4 |
Xiaohu, S., Liupu, W., You, Z., and Yanchun, L. (2008), An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows Natural Computation, Fourth International Conference on Natural Computation, 480-484.
|
5 |
Zhang, Y. and Tang, L. (2007), Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network, ISNN '07 Proceedings of the 4th international symposium on Neural Networks : Part II-Advances in Neural Networks, 63-71.
|
6 |
Irnich, S. and Villeneuve, D. (2003), The shortest path problem with resource constraints and k-cycle elimination for k 3, Cahiers du GERAD G-2003-55, HEC Montreal.
|
7 |
Righini, G. and Salani, M. (2006), Symmetry helps : Bounded bidirectional dynamic-programming for the elementary shortest path problem with resource constraints, Discrete Optimization, 3, 255-273.
DOI
ScienceOn
|
8 |
Righini, G. and Salani, M. (2008), New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, 51, 155-170.
DOI
ScienceOn
|
9 |
Houck, D., Picard, J., Queyranne, M., and Vemuganti, R. (1980), The travelling salesman problem as a constrained shortest path problem : Theory and computational experience, Opsearch, 17, 93-109.
|
10 |
Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability : A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco.
|
11 |
Desrochers, M., Desrosiers, J., and Solomon, M. (1992), A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, 40, 342-354.
DOI
ScienceOn
|
12 |
Feillet, D., Dejax, P., and Gendreau, M. (2005), Traveling salesman problems with profits, Transportation Science, 39, 188-205.
DOI
ScienceOn
|
13 |
Dror, M. (1994), Note on the complexity of the shortest path models for column generation in VRPTW, Operations Research, 42, 977-978.
DOI
ScienceOn
|