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

Authors:
Marcus Oswald;Gerhard Reinelt
Affiliations:
Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany;Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany
Venue:
Operations Research Letters
Year:
2003

Citing 2
Cited 3

Polyhedral Aspects of the Consecutive Ones Problem

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
PQ-tree algorithms.

PQ-tree algorithms.

The simultaneous consecutive ones problem

Theoretical Computer Science
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
Set covering with almost consecutive ones property

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The NP-hard weighted consecutive ones problem consists of converting a given 0/1-matrix to a consecutive ones matrix by switching entries with a minimum total cost. Here we consider this problem when the number of rows or columns is fixed. We show that in this case the problem can be solved in polynomial time.