Pages that link to "Item:Q2883634"
From MaRDI portal
The following pages link to Lower bounds for the minimal sum coloring problem (Q2883634):
Displaying 18 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← 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)
- 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)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← 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)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
- A tabu search approach for the sum coloring problem (Q2861511) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- A new heuristic for the sum coloring problem (Q2906054) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- (Q4782702) (← links)
