Pages that link to "Item:Q1742227"
From MaRDI portal
The following pages link to ILP models and column generation for the minimum sum coloring problem (Q1742227):
Displaying 5 items.
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- A column-generation approach to the multiple knapsack problem with color constraints (Q2892278) (← links)
- On a binary-encoded ILP coloring formulation (Q2892353) (← links)