scientific article
From MaRDI portal
Publication:3439702
zbMath1203.05049MaRDI QIDQ3439702
Victor A. Campos, Ricardo C. Corrêa, Manoel B. Campêlo
Publication date: 29 May 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
MIP formulations for induced graph optimization problems: a tutorial ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ A branch-and-price approach for the partition coloring problem ⋮ A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
This page was built for publication:
