On the asymmetric representatives formulation for the vertex coloring problem-Reference-Cited by-同舟云学术

On the asymmetric representatives formulation for the vertex coloring problem

Published:2008-04 Issue:7 Volume:156 Page:1097-1111
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Campêlo Manoel,Campos Victor A.,Corrêa Ricardo C.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 articles.

1. Cliques, holes and the vertex coloring polytope;Campêlo;Inform. Process. Lett.,2004

2. An exact algorithm for the maximum clique problem;Carraghan;Oper. Res. Lett.,1990

3. Facets of the graph coloring polytope;Coll;Ann. Oper. Res.,2002

4. I. Díaz, P. Zabala, A polyhedral approach for graph coloring, in: Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics—GRACO 2001, Electronic Notes in Discrete Mathematics, vol. 7, 2001.

5. R. Figueiredo, V. Barbosa, N. Maculan, C. Souza, New 0–1 integer formulations of the graph coloring problem, in: Proceedings of CLAIO 2002, Chile, 2002.

Cited by 72 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?;Computers & Operations Research;2024-08

2. Integer programming models and polyhedral study for the geodesic classification problem on graphs;European Journal of Operational Research;2024-05

3. Matheuristic Variants of DSATUR for the Vertex Coloring Problem;Lecture Notes in Computer Science;2024

4. Min–max optimization of node‐targeted attacks in service networks;Networks;2023-10-10

5. Connected graph partitioning with aggregated and non‐aggregated gap objective functions;Networks;2023-08-10