Set covering with almost consecutive ones property

Authors:
Nikolaus Ruf;Anita SchöBel
Affiliations:
University of Kaiserslautern, Germany;Institut fur Numerische und Angewandte Mathematik, Georg-August-University Göttingen, Lotzestr. 16-18, Gottingen37083, Germany
Venue:
Discrete Optimization
Year:
2004

Citing 9
Cited 5

Integer and combinatorial optimization

Integer and combinatorial optimization
Algorithms for railway crew management

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
A Heuristic Method for the Set Covering Problem

Operations Research
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

Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
A faster algorithm for finding minimum tucker submatrices

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A polynomial-time algorithm for finding a minimal conflicting set containing a given row

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Minimum membership set covering and the consecutive ones property

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in most rows of the coefficient matrix, the ones appear consecutively and only a few blocks of consecutive ones appear in the remaining rows. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecutive ones structure to develop bounds and a branching scheme. Our approach has been tested on real-world data as well as on theoretical problem instances.