Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem

DOI10.1016/J.ENDM.2006.06.080MaRDI QIDQ3439489zbMATH OpenOpenAlexFDO

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

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

Hamiltonian cycleslabelled graph algorithmstabu search

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• Comparison of heuristics for the colourful travelling salesman problem
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• The minimum labeling spanning trees
• On a Labeled Vehicle Routing Problem

Cites work

• An algorithm for finding Hamilton paths and cycles in random graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• Spanning trees with many or few colors in edge-colored graphs
• The minimum labeling spanning trees

Cited in

(9)

• The labeled maximum matching problem
• The rainbow spanning forest problem
• Two heuristics for the rainbow spanning forest problem
• Comparison of heuristics for the colourful travelling salesman problem
• A two-phase heuristic algorithm for the label printing problem
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
• Two heuristics for the label printing problem
• Fixed-parameter tractability of maximum colored path and beyond
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439489)