GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Título:

GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Autor:

Simone de Lima Martins

Ano:

2013

DOI:

10.1016/j.cor.2012.10.001

Revista:

Computers & Operations Research

ISSN:

03050548

Home:

[http://www.sciencedirect.com/science/article/pii/S0305054812002122]

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A new approach for the rainbow spanning forest problem

A Hybrid Data Mining GRASP with Path-Relinking

Ferramentas para Programação Paralela em Ambientes de Memória Distribuída

A hybrid data mining metaheuristic for the p-median problem

A matheuristic approach for the maximum balanced subgraph of a signed graph

Greedy Randomized Adaptive Search Procedures for the Steiner Problem in Graphs

A discrete search algorithm for finding the structure of protein backbones and side chains

A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection

Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy