DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits

DOI10.1016/0377-2217(88)90357-8zbMath0628.05045OpenAlexW1971074259MaRDI QIDQ1092923

Francesco A. Brunacci

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90357-8

zbMATH Keywords

networksdirected graphHamiltonian circuitDB2A

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle ⋮ Hamiltonian cycle curves in the space of discounted occupational measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the length of optimal TSP circuits in sets of bounded diameter
• A useful transform of standard input data for a classical NP-complete problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• An efficient collision-free protocol for prioritized access-control of cable or radio channels
• The NP-completeness column: An ongoing guide

This page was built for publication: DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits