Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph

DOI10.1051/ro/1981150302331zbMath0472.90066OpenAlexW2586862314MaRDI QIDQ3927068

No author found.

Publication date: 1981

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104787

zbMATH Keywords

circuitcomputational experiencecomputational comparison of methodsequivalent Hamiltonian cycle problemgraphs with random complete distance matricesshortest complete cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Paths and cycles (05C38)

Related Items (10)

A new class of cutting planes for the symmetric travelling salesman problem ⋮ Distance conserving reductions for nonoriented networks ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ Hamiltonian location problems ⋮ The Steiner traveling salesman problem and its extensions ⋮ A branch and bound algorithm for the capacitated vehicle routing problem ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ A note on finding a shortest complete cycle in an undirected graph ⋮ Compact formulations of the Steiner traveling salesman problem and related problems

This page was built for publication: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph