Pages that link to "Item:Q2883634"

The following pages link to Lower Bounds for the Minimal Sum Coloring Problem (Q2883634):

Displaying 13 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)
• 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)
• (Q2861511) (← 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)