Exact methods for the longest induced cycle problem

DOI10.17535/CRORR.2024.0016MaRDI QIDQ6617731

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

Publication date: 11 October 2024

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

zbMATH Keywords

branch-and-cut algorithmvalid inequalitiesmixed integer linear programminglongest chordless cyclelongest induced cycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding the longest isometric cycle in a graph
• Exact algorithms for finding longest cycles in claw-free graphs
• On exact solution approaches for the longest induced path problem
• An experimental study of ILP formulations for the longest induced path problem
• Longest induced cycles in circulant graphs
• New formulations and branch-and-cut procedures for the longest induced path problem
• The longest cycle of a graph with a large minimal degree
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Exact Solution Algorithms 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)