The following pages link to (Q3439702):
Displaying 5 items.
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
