A note on the NP-hardness of the consecutive block minimization problem

DOI10.1111/1475-3995.00387zbMath1044.90058OpenAlexW2011999990MaRDI QIDQ4468895

Salim Haddadi

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Heuristic methods to consecutive block minimization ⋮ Iterated local search for consecutive block minimization ⋮ Exponential neighborhood search for consecutive block minimization ⋮ On computing optimal linear diagrams ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ Hardness results on the gapped consecutive-ones property problem ⋮ Reordering columns for smaller indexes ⋮ Consecutive block minimization is 1.5-approximable ⋮ On the Gapped Consecutive-Ones Property ⋮ Polynomial-time local-improvement algorithm for consecutive block minimization

This page was built for publication: A note on the NP-hardness of the consecutive block minimization problem