Published Online:6 Jun 2025https://doi.org/10.1287/ijoc.2024.0927
- Cited by
- 29 November 2025 | Algorithms, Vol. 18, No. 12

Volume 38, Issue 3
May-June 2026
Pages 693-1031, iii
Article Information
Supplemental Material
Metrics
Information
- Received:September 26, 2024
- Accepted:April 22, 2025
- Published Online:June 06, 2025
Copyright © 2025, INFORMS
Cite as
Claudia Archetti; , Martina Cerulli; , Carmine Sorgente (2025) Branch-and-Cut Algorithms for Colorful Components Problems. INFORMS Journal on Computing 38(3):693-709.
https://doi.org/10.1287/ijoc.2024.0927
Keywords
The authors thank Diego Delle Donne (ESSEC Business School in Paris) for his valuable suggestions, as well as the anonymous referees for the careful and insightful review of the manuscript.
