Branch-and-cut algorithms for the covering salesman problem

DOI10.1051/RO/2023055arXiv2104.01173OpenAlexW3144226417MaRDI QIDQ6050582

Unnamed Author, Fábio Luiz Usberti, Celso Cavellucci

Publication date: 19 September 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.01173

zbMATH Keywords

branch-and-cut algorithminteger linear programmingcovering salesman problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics in computer science (68R05) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Branch-and-cut algorithms for the covering salesman problem