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 branc h-and-cutalgorithm and give separation algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.S. Booth 1975 PQ-Tree Algorithms PhD Thesis, University of California, Berkeley
K.S. Booth and G. Lueker 1976x Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms Journal of Computer and System Sciences, 13, 335–379
T. Christof, A. Loebel 1998 PORTA-A Polyhedron Representation Algorithm http://www.iwr.uni-heidelberg.de/iwr/comopt/software/PORTA/
T. Christof, M. Oswald and G. Reinelt 1998 Consecutive Ones and A Betweenness Problem in Computational Biology Proceedings of the 6th IPCO Conference, Houston, 1998, 213–228
M. Padberg 1995 Linear Optimization and Extensions Springer, Berlin
A. Tucker 1972 A Structure Theorem for the Consecutive l’s Property Journal of Combinatorial Theory B, 12, 153–162
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oswald, M., Reinelt, G. (2000). Polyhedral Aspects of the Consecutive Ones Problem. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_37
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive