A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
ISSN: 0377-2217
Année de publication: 2022
Volumen: 297
Número: 2
Pages: 467-483
Type: Article
ISSN: 0377-2217
Année de publication: 2022
Volumen: 297
Número: 2
Pages: 467-483
Type: Article