Polyhedral Aspects of the Consecutive Ones Problem

Authors:
Marcus Oswald;Gerhard Reinelt
Affiliations:
-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 2
Cited 1

PQ-tree algorithms.

PQ-tree algorithms.
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

The weighted consecutive ones problem for a fixed number of rows or columns

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A 0/1-matrix has the consecutive ones property for rows if its columns can be permuted such that in every row all ones appear consecutively. Whereas it is easy to decide whether a given matrix has the consecutive ones property, it is difficult to find for a given 0/1-matrix B a consecutive ones matrix A that resembles B as closely as possible (in a sense to be specified). In this paper we study the latter problem from a polyhedral point of view and discuss an integer programming formulation that can serve as a basis for a branch-and-cut algorithm and give separation algorithms.