A comparison of integer and constraint programming models for the deficiency problem

作者：Altinakar Sivan; Caporossi Gilles; Hertz Alain^*

来源：Computers & Operations Research, 2016, 68: 89-96.

DOI：10.1016/j.cor.2015.10.016

• Compact edge-colorings
• Integer linear programming
• Constraint programming

An edge-coloring of a graph G = (V, E) is a function c that assigns an integer c(e) (called color) in {0,1,2, ... } to every edge e e E so that adjacent edges are assigned different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The deficiency problem is to determine the minimum number of pendant edges that must be added to a graph such that the resulting graph admits a compact edge-coloring. We propose and analyze three integer programming models and one constraint programming model for the deficiency problem.

• 出版日期2016-4