Polyhedral results for the Equitable Coloring Problem

Details Polyhedral results for the Equitable Coloring Problem Polyhedral results for the Equitable Coloring Problem

2011-06-16

arxiv.org/abs/1106.3349v1

Computer Science

Discrete Mathematics

Scientific paper

10.1016/j.endm.2011.05.028

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 of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

Affiliated with

Also associated with

No associations

Rating

Polyhedral results for the Equitable Coloring Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polyhedral results for the Equitable Coloring Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polyhedral results for the Equitable Coloring Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695221