Vehicle Routing Problem
收藏DataCite Commons2026-01-07 更新2026-05-05 收录
下载链接：
https://service.tib.eu/ldmservice/dataset/9b43d86c-682d-45e5-aedd-4f18fbb3c7a1
下载链接
链接失效反馈官方服务：
资源简介：
The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and returns to the starting node.
提供机构：
TIB
创建时间：
2024-12-03
