scientific article; zbMATH DE number 5158521

MaRDI QIDQ3439702zbMATH OpenFDO

Authors Victor Campos, Ricardo C. Corrêa, Manoel Campêlo

Publication date 29 May 2007

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Programming involving graphs or networks (90C35)

Cited in

(8)

• A branch-and-price approach for the partition coloring problem
• A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• MIP formulations for induced graph optimization problems: a tutorial
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
• The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
• Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
• Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439702)