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

Título:

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

Autor:

Isabel Cristina Mello Rosseti

Ano:

2021

DOI:

10.1051/ro/2020002

Revista:

RAIRO-OPERATIONS RESEARCH

ISSN:

03990559

Home:

[doi:10.1051/ro/2020002]

Idioma:

Português

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Improving a state-of-the-art heuristic for the minimum latency problem with data mining

A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy

Reactive GRASP for the prize-collecting covering tour problem

A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model

A hybrid data mining heuristic to solve the point¿feature cartographic label placement problem

A Provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows

Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem

A biased random-key genetic algorithm for the maximum quasi-clique problem

Making a state-of-the-art heuristic faster with data mining

Extending the hybridization of metaheuristics with data mining: Dealing with sequences