Abstract
We show that consecutive block minimization problem is NP–hard even when restricted to binary matrices that have two ones per row.
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 callMore From: International transactions in operational research : a journal of The International Federation of Operational Research Societies
Paper Title
Journal
Date
