A new formulation and a branch-and-cut algorithm for the set orienteering problem

DOI10.1016/j.ejor.2023.09.038OpenAlexW4387223438MaRDI QIDQ6128935

Raffaele Cerulli, Claudia Archetti, Francesco Carrabs, Federica Laureana

Publication date: 16 April 2024

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.09.038

zbMATH Keywords

integer linear programmingbranch-and-cutroutingorienteering problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

This page was built for publication: A new formulation and a branch-and-cut algorithm for the set orienteering problem