Solving the minimum-weighted coloring problem
type: Item
instance of: scholarly article
title: Solving the minimum-weighted coloring problem
zbMATH Open document ID: 0983.68150
author: Massimiliano Caramia
author: Paolo Dell'Olmo
published in: Networks
publication date: 2001-10-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1659253
zbMATH Keywords: weighted coloring
describes a project that uses: GraphBase
MaRDI profile type: Publication
full work available at URL: net.1028
OpenAlex ID: W2000192838
cites work: Finding maximum cliques in arbitrary and in special graphs
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: New methods to color the vertices of a graph
cites work: A lower bound on the chromatic number of Mycielski graphs
cites work: CHECKCOL: improved local search for graph coloring
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Q4198056
cites work: Q3140399
cites work: Consistency in networks of relations
cites work: A Column Generation Approach for Graph Coloring
cites work: A Pruning Procedure for Exact Graph Coloring
cites work: Q5687263
DOI: 10.1002/NET.1028
description: scientific article; zbMATH DE number 1659253