A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem

DOI10.1051/ro/2020002zbMath1472.90109OpenAlexW2998709212MaRDI QIDQ5002254

Luidi Simonetti, Glaubos Clímaco, Isabel Rosseti

Publication date: 27 July 2021

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

Full work available at URL: https://doi.org/10.1051/ro/2020002

zbMATH Keywords

branch-and-cutMIP heuristicsprize-collecting traveling salesman problem

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Related Items (4)

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio

This page was built for publication: A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem