Jun 2026
Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments
Four mixed-integer linear programming formulations are proposed, including a compact flow-based model and a representatives model, and corresponding solution methods are designed, and the polytopes associated with the linear relaxation of the proposed formulations are compared.
Boyue Lin, Phablo F. S. Moura, Roel Leus
· arXiv.org · 0 citations