scientific article
From MaRDI portal
Publication:2861511
zbMath1274.90296MaRDI QIDQ2861511
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001174
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ An effective heuristic algorithm for sum coloring of graphs
Cites Work
- Using tabu search techniques for graph coloring
- On the cost-chromatic number of graphs
- The chromatic sum of a graph: history and recent developments
- Minimal coloring and strength of graphs
- Lower Bounds for the Minimal Sum Coloring Problem
- Tight bounds on the chromatic sum of a connected graph
- Approximation and Online Algorithms
This page was built for publication:
