A note on the NP-hardness of the consecutive block minimization problem
From MaRDI portal
Publication:4468895
DOI10.1111/1475-3995.00387zbMath1044.90058MaRDI QIDQ4468895
Publication date: 11 June 2004
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00387
90C27: Combinatorial optimization
Related Items
On computing optimal linear diagrams, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, Reordering columns for smaller indexes, Consecutive block minimization is 1.5-approximable, Hardness results on the gapped consecutive-ones property problem, Polynomial-time local-improvement algorithm for consecutive block minimization, Heuristic methods to consecutive block minimization, Iterated local search for consecutive block minimization, On the Gapped Consecutive-Ones Property