Pages that link to "Item:Q2239844"
From MaRDI portal
The following pages link to A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844):
Displaying 5 items.
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)