Solving a multicoloring problem with overlaps using integer programming

Authors:
Isabel Méndez-Díaz;Paula Zabala
Affiliations:
Departamento de Computación, FCEyN - Universidad de Buenos Aires, Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina;Departamento de Computación, FCEyN - Universidad de Buenos Aires, Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 5
Cited 0

Channel assignment and graph multicoloring

Handbook of wireless networks and mobile computing
Using Integer Programming to Solve the Train-Platforming Problem

Transportation Science
Preface: Special issue on computational methods for graph coloring and its generalizations

Discrete Applied Mathematics
On a Binary-Encoded ILP Coloring Formulation

INFORMS Journal on Computing
A Branch-and-Cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes separation heuristics for the valid inequalities, specific initial and primal heuristics, branching and pruning rules. We report on computational experience with random instances.