"Branch-and-cut algorithms for the covering salesman problem."

Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci (2021)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2023-06-16

a service of  Schloss Dagstuhl - Leibniz Center for Informatics