Exact methods for the longest induced cycle problem

DOI10.17535/CRORR.2024.0016MaRDI QIDQ6617731zbMATH OpenFDO

Authors Ahmad Turki Anaqreh, Boglárka G.-Tóth, Tamás Vinkó

Publication date 11 October 2024

Published in Croatian Operational Research Review (CRORR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.17535/CRORR.2024.0016

zbMATH Keywords

branch-and-cut algorithmlongest chordless cyclelongest induced cyclemixed integer linear programmingvalid inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• On exact solution approaches for the longest induced path problem
• Exact and approximate algorithms for the longest induced path problem
• An experimental study of ILP formulations for the longest induced path problem
• Exact algorithms for finding longest cycles in claw-free graphs
• Exact Solution Algorithms for the Chordless Cycle Problem

Cites work

• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• An experimental study of ILP formulations for the longest induced path problem
• Exact algorithms for finding longest cycles in claw-free graphs
• Exact Solution Algorithms for the Chordless Cycle Problem
• Finding the longest isometric cycle in a graph
• scientific article; zbMATH DE number 3694608 (Why is no real title available?)
• Longest induced cycles in circulant graphs
• New formulations and branch-and-cut procedures for the longest induced path problem
• On exact solution approaches for the longest induced path problem
• The longest cycle of a graph with a large minimal degree

Cited in

(2)

• Methods for determining cycles of a specific length in undirected graphs with edge weights
• Semidefinite programming bounds and a branch-and-bound algorithm for the chordless cycle problem

This page was built for publication: Exact methods for the longest induced cycle problem

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