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 |
| LEADER | 01514nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | publ36644 | ||
| 005 | 20250505151605.0 | ||
| 008 | 250505s2024 hu o 000 eng d | ||
| 022 | |a 1848-0225 | ||
| 024 | 7 | |a 10.17535/crorr.2024.0016 |2 doi | |
| 024 | 7 | |a 35607402 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Anaqreh Ahmad | |
| 245 | 1 | 0 | |a Exact methods for the longest induced cycle problem |h [elektronikus dokumentum] / |c Anaqreh Ahmad |
| 260 | |c 2024 | ||
| 300 | |a 199-212 | ||
| 490 | 0 | |a CROATIAN OPERATIONAL RESEARCH REVIEW |v 15 No. 2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 700 | 0 | 2 | |a Gazdag-Tóth Boglárka |e aut |
| 700 | 0 | 2 | |a Vinkó Tamás |e aut |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/36644/1/ad.pdf |z Dokumentum-elérés |