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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
