ILP models and column generation for the minimum sum coloring problem
type: Item
instance of: scholarly article
title: ILP models and column generation for the minimum sum coloring problem
zbMATH Open document ID: 1388.05064
author: Fabio Furini
author: Enrico Malaguti
author: Ian-Christopher Ternier
author: Sébastien Martin
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6858359
zbMATH Keywords: graph coloring
zbMATH Keywords: integer programming
zbMATH Keywords: column generation
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.023
OpenAlex ID: W2789976508
Wikidata QID: Q57659006
cites work: Tight bounds on the chromatic sum of a connected graph
cites work: Maximum-weight stable sets and safe lower bounds for graph coloring
cites work: A memetic algorithm for the minimum sum coloring problem
cites work: Hybrid evolutionary search for the minimum sum coloring problem of graphs
cites work: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
cites work: Lower bounds for the minimal sum coloring problem
cites work: A survey on vertex coloring problems
cites work: A Column Generation Approach for Graph Coloring
cites work: On the cost-chromatic number of graphs
cites work: On sum coloring of graphs
cites work: On a graph partition problem with application to VLSI layout
cites work: A new \textsf{DSATUR}-based algorithm for exact vertex coloring
cites work: An effective heuristic algorithm for sum coloring of graphs
DOI: 10.1016/J.ENDM.2018.01.023
description: scientific article; zbMATH DE number 6858359