On a Binary-Encoded ILP Coloring Formulation
نویسندگان
چکیده
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficient separation algorithm for general block inequalities, (ii) an efficient LP-based separation algorithm for stars (i.e., the all-different polytope), (iii) introduction of matching inequalities, (iv) introduction of switched path inequalities and their efficient separation, (v) a complete description for paths, and (vi) promising computational results.
منابع مشابه
More on a Binary-Encoded Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficient separation algorithm for general block inequalities, (ii) an efficient LP-based separation algorithm for stars (i.e., the all-different polytope), (iii) introduction of matching inequalities, and (iv) introduction ...
متن کاملSymmetric ILP: Coloring and small integers
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary variables. Orthogonal array construction and coloring problems are used as illustrations.
متن کاملPolyhedral studies on the convex recoloring
A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We...
متن کاملPredictable paging in real-time systems: an ILP formulation
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. In [7] we have proposed a compiler approach to introduce a predictable form of paging, in which page-in and page-out points are selected at compile-time. In [7], the problem under study was formulated as a graph coloring problem. Since the graph...
متن کاملOn the representatives k-fold coloring polytope
A k-fold x-coloring of a graph G is an assignment of (at least) k distinct colors from the set {1, 2, . . . , x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The k-th chromatic number of G, denoted by χk(G), is the smallest x such that G admits a k-fold x-coloring. We present an ILP formulation to determine χk(G) and study the facial structure of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 19 شماره
صفحات -
تاریخ انتشار 2007