A polyhedral approach for the equitable coloring problem

被引：8
|
作者：
Mendez-Diaz, Isabel [1 ]
Nasini, Graciela [2 ,3 ]
Severin, Daniel [2 ,3 ]
机构：
[1] Univ Buenos Aires, FCEyN, RA-2160 Intendente Guiraldes, Argentina
[2] Univ Nacl Rosario, FCEIA, RA-2000 Rosario, Santa Fe, Argentina
[3] Consejo Nacl Invest Cient & Tecn, RA-1033 Buenos Aires, DF, Argentina
来源：
DISCRETE APPLIED MATHEMATICS | 2014年 / 164卷
关键词：
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.
引用
收藏
页码：413 / 426
页数：14
相关论文
共 50 条
  • [1] Memetic search for the equitable coloring problem
    Sun, Wen
    Hao, Jin-Kao
    Wang, Wenyu
    Wu, Qinghua
    KNOWLEDGE-BASED SYSTEMS, 2020, 188
  • [2] A POLYHEDRAL APPROACH TO EDGE COLORING
    NEMHAUSER, GL
    PARK, S
    OPERATIONS RESEARCH LETTERS, 1991, 10 (06) : 315 - 322
  • [3] A polyhedral study of the acyclic coloring problem
    Braga, Monica
    Delle Donne, Diego
    Marenco, Javier
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2606 - 2617
  • [4] New bounds for the nearly equitable edge coloring problem
    Xie, Xuzhen
    Yagiura, Mutsunori
    Ono, Takao
    Hirata, Tomio
    Zwick, Uri
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 280 - +
  • [5] A DSATUR-based algorithm for the Equitable Coloring Problem
    Mendez-Diaz, Isabel
    Nasini, Graciela
    Severin, Daniel
    COMPUTERS & OPERATIONS RESEARCH, 2015, 57 : 41 - 50
  • [6] An effcient algorithm for the nearly equitable edge coloring problem
    Graduate School of Information Science, Nagoya University, Nagoya 464-8603, Japan
    不详
    J. Graph Algorithms and Appl., 2008, 4 (383-399):
  • [7] EQUITABLE COLORING
    MEYER, W
    AMERICAN MATHEMATICAL MONTHLY, 1973, 80 (08): : 920 - 922
  • [8] An improved algorithm for the nearly equitable edge-coloring problem
    Xie, XZ
    Ono, T
    Nakano, S
    Hirata, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (05): : 1029 - 1033
  • [9] EQUITABLE COLORING OF TREES
    CHEN, BL
    LIH, KW
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (01) : 83 - 87
  • [10] Equitable coloring of hypergraphs
    Furmanczyk, Hanna
    Obszarski, Pawel
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 186 - 192
12345