Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  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 ll known that the set covering problem can be solved efficiently. For our case of almost consecutive ones  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 ll as on theoretical problem instances.
['Nikolaus Ruf', 'Anita Schöbel']
I am writing a research paper on a idea Set covering with almost consecutive ones property
[{"from": "human", "value": "I am writing a research paper on a idea Set covering with almost consecutive ones property"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  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 ll known that the set covering problem can be solved efficiently. For our case of almost consecutive ones  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 ll as on theoretical problem instances."}]