Exact methods for the longest induced cycle problem
The longest induced (or chordless) cycle problem is a graph problem classified as NP-complete and involves the task of determining the largest possible subset of vertices within a graph in such a way that the induced subgraph forms a cycle. Within this paper, we present three integer linear programs...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2024
|
| Sorozat: | CROATIAN OPERATIONAL RESEARCH REVIEW
15 No. 2 |
| Tárgyszavak: | |
| doi: | 10.17535/crorr.2024.0016 |
| mtmt: | 35607402 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/36644 |
| Tartalmi kivonat: | The longest induced (or chordless) cycle problem is a graph problem classified as NP-complete and involves the task of determining the largest possible subset of vertices within a graph in such a way that the induced subgraph forms a cycle. Within this paper, we present three integer linear programs specifically formulated to yield optimal solutions for this problem. The branch-and-cut algorithm has been used for two models that cannot be directly solved by any MILP solver. To demonstrate the computational efficiency of these methods, we utilize them on a range of real-world graphs as well as random graphs. Additionally, we conduct a comparative analysis against approaches previously proposed in the literature. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 199-212 |
| ISSN: | 1848-0225 |