Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem

DOI10.1016/j.endm.2006.06.080zbMath1134.05322OpenAlexW2051153057MaRDI QIDQ3439489

Paolo Dell'Olmo, Andrea Raiconi, Monica Gentili, Raffaele Cerulli

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.080

zbMATH Keywords

tabu searchHamiltonian cycleslabelled graph algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Two heuristics for the rainbow spanning forest problem ⋮ A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants ⋮ The labeled maximum matching problem ⋮ The rainbow spanning forest problem ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for finding Hamilton paths and cycles in random graphs
• The minimum labeling spanning trees
• Spanning trees with many or few colors in edge-colored graphs

This page was built for publication: Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem