Methods for determining cycles of a specific length in undirected graphs with edge weights

Lewis, R. ORCID: https://orcid.org/0000-0003-1046-811X, Corcoran, P. ORCID: https://orcid.org/0000-0001-9731-3385 and Gagarin, A. ORCID: https://orcid.org/0000-0001-9749-9706 2023. Methods for determining cycles of a specific length in undirected graphs with edge weights. Journal of Combinatorial Optimization 46 , 29. 10.1007/s10878-023-01091-w

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

In this paper, we consider the NP-hard problem of determining fixed-length cycles in undirected edge-weighted graphs. Two solution methods are proposed, one based on integer programming (IP) and one that uses bespoke local search operators. These methods are executed under a common algorithmic framework that seeks to partition problem instances into a series of smaller sub-problems. Large-scale empirical tests indicate that the local search algorithm is generally preferable to IP, even with short run times. However, it can still produce suboptimal solutions, even with relatively small graphs.

Item Type:	Article
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics Mathematics
Publisher:	Springer
ISSN:	1573-2886
Date of First Compliant Deposit:	13 November 2023
Date of Acceptance:	19 October 2023
Last Modified:	12 Apr 2024 12:40
URI:	https://orca.cardiff.ac.uk/id/eprint/163843

Actions (repository staff only)

Edit Item