Pages that link to "Item:Q2419584"
From MaRDI portal
The following pages link to An integer programming approach to b-coloring (Q2419584):
Displaying 9 items.
- Almost optimal solutions for bin coloring problems (Q941831) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- New Steiner 2-designs from old ones by paramodifications (Q2208353) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- Algorithms and Computation (Q5897842) (← links)
- Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)