Journal articles
Year
2012
Abstract
The acyclic coloring problem arises in the context of efficient computations of sparse and symmetric Hessian matrices via substitution methods. In this work we start an integer programming approach for this problem, by introducing a natural integer programming formulation and presenting six families of facet-inducing valid inequalities.
BRAGA, M., DELLE DONNE, D. et MARENCO, J. (2012). A polyhedral study of the acyclic coloring problem. Discrete Applied Mathematics, 160(18), pp. 2606-2617.