Pages that link to "Item:Q1762148"
From MaRDI portal
The following pages link to An effective heuristic algorithm for sum coloring of graphs (Q1762148):
Displayed 11 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← 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)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Team selection for prediction tasks (Q5963648) (← links)