Author:
Alihodzic Adis,Tuba Eva,Tuba Milan
Publisher
Springer Nature Switzerland
Reference23 articles.
1. Braca, J., Bramel, J., Posner, B., Simchi-Levi, D.: A computerized approach to the New York city school bus routing problem. IIE Trans. 29(8), 693–702 (2007). https://doi.org/10.1080/07408179708966379
2. Bräysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. TOP 10(2), 211–237 (2002). https://doi.org/10.1007/BF02579017
3. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255–282 (1981). https://doi.org/10.1007/BF01589353
4. Clarke, G., Wright, J.: Scheduling of vehicle routing problem from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964). https://doi.org/10.1287/opre.12.4.568
5. CPLEX: IBM ILOG CPLEX Optimization Studio CPLEX User’s Manual V 12.7. International Business Machines Corporation (2017). https://www.ibm.com/support/knowledgecenter/SSSA5P_12.7.1/ilog.odms.studio.help/pdf/usrcplex.pdf