Equitable graph coloring;
Integer programming;
Cut and branch;
ORBITOPES;
D O I:
10.1016/j.dam.2012.11.018
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm. (C) 2012 Elsevier B.V. All rights reserved.
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-69978 Tel Aviv, IsraelCent European Univ, Dept Math & Its Applicat, H-1051 Budapest, Hungary
Krivelevich, Michael
Patkos, Balazs
论文数: 0引用数: 0
h-index: 0
机构:
Cent European Univ, Dept Math & Its Applicat, H-1051 Budapest, HungaryCent European Univ, Dept Math & Its Applicat, H-1051 Budapest, Hungary
机构:
Univ Fed Rio de Janeiro, COPPE, Programa Engn Prod, BR-21945970 Rio De Janeiro, RJ, BrazilUniv Fed Rio de Janeiro, COPPE, Programa Engn Prod, BR-21945970 Rio De Janeiro, RJ, Brazil
Bahiense, Laura
Frota, Yuri
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Fluminense, Dept Ciencia Comp, BR-22410240 Niteroi, RJ, BrazilUniv Fed Rio de Janeiro, COPPE, Programa Engn Prod, BR-21945970 Rio De Janeiro, RJ, Brazil
Frota, Yuri
Noronha, Thiago F.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Minas Gerais, Dept Ciencia Comp, BR-31270010 Belo Horizonte, MG, BrazilUniv Fed Rio de Janeiro, COPPE, Programa Engn Prod, BR-21945970 Rio De Janeiro, RJ, Brazil
Noronha, Thiago F.
Ribeiro, Celso C.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Fluminense, Dept Ciencia Comp, BR-22410240 Niteroi, RJ, BrazilUniv Fed Rio de Janeiro, COPPE, Programa Engn Prod, BR-21945970 Rio De Janeiro, RJ, Brazil