Integer programming formulations for minimum deficiency interval coloring

  title={Integer programming formulations for minimum deficiency interval coloring},
  author={Merve Bodur and James R. Luedtke},
  pages={249 - 271}
A proper edge‐coloring of a given undirected graph with natural numbers identified with colors is an interval (or consecutive) coloring if the colors of edges incident to each vertex form an interval of consecutive integers. Not all graphs admit such an edge‐coloring and the problem of deciding whether a graph is interval colorable is NP‐complete. For a graph that is not interval colorable, determining a graph invariant called the (minimum) deficiency is a widely used approach. Deficiency is a… 
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
A graph G is called interval colorable if it has a proper edge coloring with colors 1, 2, 3, . . . such that the colors of the edges incident to every vertex of G form an interval of integers. Not
Improved GMM-based method for target detection
An improved GMM method is presented to solve the problem of large-scale misdetection in the static case where the background and foreground have similar colours and identified the target areas with high accuracy and high efficiency.
Compact Scheduling of Open Shops
  • W. Kubiak
  • Business
    International Series in Operations Research & Management Science
  • 2021


A comparison of integer and constraint programming models for the deficiency problem
Symmetry Breaking Constraints for the Minimum Deficiency Problem
A way to generate a set of symmetry breaking constraints, called gamblle constraints, that can be added to a constraint programming model that is inspired by the Lex-Leader ones, based on automorphisms of graphs, and act on families of permutable variables is presented.
Lower bounds and a tabu search algorithm for the minimum deficiency problem
New lower bounds are given on the minimum deficiency of an edge coloring and on the span of edge colorings with minimum deficiency and a tabu search algorithm is proposed to solve theminimum deficiency problem.
Consecutive colorings of the edges of general graphs
The deficiency of a regular graph
Interval coloring of (3,4)‐biregular bipartite graphs having large cubic subgraphs
An interval coloring of a graph is a proper edge coloring such that the set of used colors at every vertex is an interval of integers. Generally, it is an NP‐hard problem to decide whether a graph
Consecutive edge-coloring of the generalized theta-graph
Investigation on Interval Edge-Colorings of Graphs
An edge-coloring of a simple graph G with colors 1, 2,..., t is called an interval t-coloring 3] if at least one edge of G is colored by color i, i = 1, ..., t and the edges incident with each vertex
On the Deficiency of Bipartite Graphs
On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles
A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval