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

DOI10.1111/1475-3995.00387MaRDI QIDQ4468895zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

• 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
• Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• Reordering columns for smaller indexes
• Exponential neighborhood search for consecutive block minimization
• On computing optimal linear diagrams
• Box covers and domain orderings for beyond worst-case join processing
• Consecutive block minimization is 1.5-approximable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4468895)