A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
From MaRDI portal
Publication:1265891
DOI10.1023/A:1018961208614zbMath0908.90261OpenAlexW6085742MaRDI QIDQ1265891
Francesco Maffioli, Mauro Dell'Amico, Anna Sciomachen
Publication date: 27 September 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018961208614
Related Items (7)
An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
This page was built for publication: A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
