Pages that link to "Item:Q1983110"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the minimum sum coloring problem (Q1983110):
Displaying 11 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
