1. Laporte G., Nobert Y. A branch and bound algorithm for the capacitated vehicle routing problem // Operations-Research-Spektrum. 1983. V. 5. P. 77–85.
2. Cook W., Rich J.L. A parallel cutting-plane algorithm for the vehicle routing problem with time windows // Technical Report TR99-04, Computational and Applied Mathematics, Rice University, Housten. 1999.
3. Augerat P., Naddef D., Belenguer J.M., et al. Computational results with a branch and cut code for the capacitated vehicle routing problem / Research report — IMAG. 1995.
4. IBM ILOG Cplex V12. 1: User’s Manual for CPLEX // Int. Busin. Machin. Corporat. 2009. V. 46. No. 53. P. 157.
5. Bestuzheva K., Besancon M., Chen W.-K., et al. The SCIP Optimization Suite 8.0 // Technical Report, Optimization Online. 2021. http://www.optimization-online.org/DB_HTML/2021/12/8728.html