Pages that link to "Item:Q1615675"
From MaRDI portal
The following pages link to Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675):
Displaying 11 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application (Q1791912) (← 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)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering (Q6071251) (← links)