Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics, 2013 - inderscienceonline.com
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …
被引用次数：15 相关文章
[PDF] archive.org

[PDF][PDF] Comparison of heuristics for the colourful travelling salesman problem

J Silberholz, A Raiconi, R Cerulli, M Gentili… - Int. J …, 2013 - scholar.archive.org
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …

Comparison of heuristics for the colourful travelling salesman problem

J Silberholz, A Raiconi, R Cerulli, M Gentili… - International Journal of …, 2013 - dl.acm.org
In the colourful travelling salesman problem CTSP, given a graph G with a not necessarily
distinct label colour assigned to each edge, a Hamiltonian tour with the minimum number of …
[PDF] umich.edu

[PDF][PDF] Comparison of Heuristics for the Colorful Traveling Salesman Problem

J Silberholz, A Raiconi, R Cerulli, M Gentili, B Golden… - www-personal.umich.edu
Abstract In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not
necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the …
[PDF] psu.edu

[PDF][PDF] Comparison of Heuristics for the Colorful Traveling Salesman Problem

J Silberholz, A Raiconi, R Cerulli, M Gentili, B Golden… - Citeseer
Abstract In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not
necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the …
[PDF] umich.edu

[PDF][PDF] Comparison of Heuristics for the Colorful Traveling Salesman Problem

J Silberholz, A Raiconi, R Cerulli, M Gentili, B Golden… - public.websites.umich.edu
Abstract In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not
necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the …
[PDF] researchgate.net

[PDF][PDF] Comparison of heuristics for the colourful travelling salesman problem

J Silberholz, A Raiconi, R Cerulli, M Gentili… - Int. J …, 2013 - researchgate.net
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …
[PDF] unisa.it

[PDF][PDF] Comparison of Heuristics for the Colorful Traveling Salesman Problem

J Silberholz, A Raiconi, R Cerulli, M Gentili, B Golden… - dipmat2.unisa.it
Abstract In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not
necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the …

Comparison of heuristics for the colourful travelling salesman problem

J Silberholz, A Raiconi, R Cerulli, M Gentili… - International …, 2013 - inderscience.com
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …
[PDF] academia.edu

[PDF][PDF] Comparison of Heuristics for the Colorful Traveling Salesman Problem

J Silberholz, A Raiconi, R Cerulli, M Gentili, B Golden… - academia.edu
Abstract In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not
necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the …