Lower Bounds for the Minimal Sum Coloring Problem
From MaRDI portal
Publication:2883634
DOI10.1016/j.endm.2010.05.084zbMath1237.90267OpenAlexW2015319622MaRDI QIDQ2883634
K. Sghiouer, Aziz Moukrim, Yu Li, Corinne Lucet
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.084
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
Lower Bounds for the Minimal Sum Coloring Problem ⋮ Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ Minimum sum coloring problem: upper bounds for the chromatic strength ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ A new ant colony optimization algorithm for the lower bound of sum coloring problem ⋮ A branch-and-price algorithm for the minimum sum coloring problem ⋮ ILP models and column generation for the minimum sum coloring problem ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ An effective heuristic algorithm for sum coloring of graphs ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Unnamed Item ⋮ On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application
Cites Work
- Unnamed Item
- Using tabu search techniques for graph coloring
- On sum coloring of graphs
- Hybrid evolutionary algorithms for graph coloring
- An exact method for graph coloring
- A branch-and-cut algorithm for graph coloring
- Lower Bounds for the Minimal Sum Coloring Problem
- Minimum Color Sum of Bipartite Graphs
- Approximation Results for the Optimum Cost Chromatic Partition Problem
This page was built for publication: Lower Bounds for the Minimal Sum Coloring Problem
