Optimal patchings for consecutive ones matrices

We study a variant of the weighted consecutive ones property problem. Here, a 0/1-matrix is given with a cost associated to each of its entries and one has to find a minimum cost set of zero entries to be turned to ones in order to make the matrix have the consecutive ones property for rows. We investigate polyhedral and combinatorial properties of the problem and we exploit them in a branch-and-cut algorithm. In particular, we devise preprocessing rules and investigate variants of “local cuts”. We test the resulting algorithm on a number of instances, and we report on these computational experiments.

[1]  C. A. Bentivoglio,et al.  Heuristic and exact methods for the cutting sequencing problem , 1998, Eur. J. Oper. Res..

[2]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[3]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[4]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[5]  Marcus Oswald,et al.  Local cuts revisited , 2008, Oper. Res. Lett..

[6]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[7]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[8]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[9]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[10]  Michael Joswig,et al.  Polymake: an approach to modular software design in computational geometry , 2001, SCG '01.

[11]  Marcus Oswald.  Weighted Consecutive Ones Problems , 2003 .

[12]  Gerhard Reinelt,et al.  Constructing New Facets of the Consecutive Ones Polytope , 2001, Combinatorial Optimization.

[13]  Giovanni Rinaldi,et al.  Primal separation for 0/1 polytopes , 2003, Math. Program..

[14]  D. Kendall.  Incidence matrices, interval graphs and seriation in archeology. , 1969 .

[15]  Jon Louis Bentley,et al.  Programming pearls , 1987, CACM.

[16]  William J. Cook,et al.  Local cuts for mixed-integer programming , 2013, Math. Program. Comput..

[17]  L. D. Giovanni,et al.  New Facets for the Consecutive Ones Polytope , 2015 .

[18]  Peter J. Stuckey,et al.  Dynamic Programming to Minimize the Maximum Number of Open Stacks , 2007, INFORMS J. Comput..

[19]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[20]  Horacio Hideki Yanasse,et al.  Connections between cutting-pattern sequencing, VLSI design, and flexible machines , 2002, Comput. Oper. Res..

[21]  Michael Jünger,et al.  A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes , 1997, J. Comput. Biol..

[22]  Kellogg S. Booth.  PQ-tree algorithms. , 1975 .

[23]  Giovanni Rinaldi,et al.  A heuristic and an exact method for the gate matrix connection cost minimization problem , 2013, Int. Trans. Oper. Res..

[24]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[25]  A. Tucker,et al.  A structure theorem for the consecutive 1's property☆ , 1972 .

[26]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[27]  Gerhard Reinelt,et al.  Computing Optimal Consecutive Ones Matrices , 2004, The Sharpest Cut.

[28]  Benjamin Müller,et al.  The SCIP Optimization Suite 5.0 , 2017, 2112.08872.