An exact algorithm for the partition coloring problem
type: Item
instance of: scholarly article
title: An exact algorithm for the partition coloring problem
zbMATH Open document ID: 1391.90603
author: Fabio Furini
author: Enrico Malaguti
author: Alberto Santini
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/18641
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6902797
zbMATH Keywords: vertex coloring
zbMATH Keywords: partitioning coloring
zbMATH Keywords: selective coloring
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-price algorithm
cites work: gCol
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Automatic Dantzig-Wolfe reformulation of mixed integer programs
cites work: Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
cites work: Perfectness of clustered graphs
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: Cliques, holes and the vertex coloring polytope
cites work: Solving vertex coloring problems as maximum weight stable set problems
cites work: On the minimum and maximum selective graph coloring problems in some graph classes
cites work: On some applications of the selective graph coloring problem
cites work: On the complexity of the selective graph coloring problem in some special classes of graphs
cites work: Column Generation
cites work: A branch-and-cut algorithm for partition coloring
cites work: Exact weighted vertex coloring via branch-and-price
cites work: Exact solution of graph coloring problems via constraint programming and column generation
cites work: Maximum-weight stable sets and safe lower bounds for graph coloring
cites work: A branch-and-price approach for the partition coloring problem
cites work: An exact approach for the vertex coloring problem
cites work: A survey on vertex coloring problems
cites work: A Column Generation Approach for Graph Coloring
cites work: Routing and wavelength assignment by partition colouring
cites work: Q4247451
cites work: Branching in branch-and-price: A generic scheme
cites work: Q5790850
describes a project that uses: gCol
describes a project that uses: irace
describes a project that uses: sgcp-via-cliques
MaRDI profile type: Publication
OpenAlex ID: W2778024817
DOI: 10.1016/J.COR.2017.12.019
description: scientific article; zbMATH DE number 6902797