Pages that link to "Item:Q2748384"
From MaRDI portal
The following pages link to Solving the minimum-weighted coloring problem (Q2748384):
Displaying 9 items.
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- An algorithm for constructing a weight-controlled subset and its application to graph coloring problem (Q1175054) (← links)
- Solving the minimum weighted integer coloring problem (Q1273422) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- On the minimum load coloring problem (Q2466019) (← links)
- (Q5708530) (← links)