Pages that link to "Item:Q336939"
From MaRDI portal
The following pages link to A memetic algorithm for the minimum sum coloring problem (Q336939):
Displaying 13 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations (Q342272) (← 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)
- Uncertain vertex coloring problem (Q2001167) (← 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)
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
