Pages that link to "Item:Q4468895"

The following pages link to A note on the NP-hardness of the consecutive block minimization problem (Q4468895):

Displayed 9 items.

• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) ‎ (← links)
• Reordering columns for smaller indexes (Q545370) ‎ (← links)
• Consecutive block minimization is 1.5-approximable (Q975428) ‎ (← links)
• Hardness results on the gapped consecutive-ones property problem (Q1759853) ‎ (← links)
• Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864) ‎ (← links)
• Heuristic methods to consecutive block minimization (Q2664289) ‎ (← links)
• Iterated local search for consecutive block minimization (Q2668701) ‎ (← links)
• On the Gapped Consecutive-Ones Property (Q2851450) ‎ (← links)
• On computing optimal linear diagrams (Q6108740) ‎ (← links)