A Branch-and-Cut algorithm for an urban dial-a-ride problem - instance data
收藏官方服务：
资源简介：
This data set includes the instances used in the paper "A Branch-and-Cut algorithm for an urban dial-a-ride problem".
提供机构：
Universität Hamburg创建时间：
2022-02-22
