Login / Signup
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem.
Glaubos Clímaco
Luidi Simonetti
Isabel Rosseti
Published in:
RAIRO Oper. Res. (2021)
Keyphrases
</>
prize collecting
mixed integer programming
feasible solution
travel time
heuristic search
beam search
search algorithm
mathematical programming
quadratic assignment problem
special case
linear programming
branch and bound
search methods
search strategies
lp relaxation
single machine scheduling problem