Polyhedral aspects of the consecutive ones problem

MaRDI QIDQ2712305zbMATH OpenFDO

Authors Marcus Oswald, Gerhard Reinelt

Publication date 6 May 2001

zbMATH Keywords

branch-and-cut algorithminteger programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Polyhedral aspects of the consecutive ones problem
• scientific article; zbMATH DE number 2003406
• scientific article; zbMATH DE number 5606342
• Optimal patchings for consecutive ones matrices
• scientific article; zbMATH DE number 3848609

Cited in

(16)

• The simultaneous consecutive ones problem
• An extension of a theorem of Fulkerson and Gross
• Optimal patchings for consecutive ones matrices
• Heuristic methods to consecutive block minimization
• Polyhedral aspects of the consecutive ones problem
• scientific article; zbMATH DE number 3848609 (Why is no real title available?)
• Parallel recognition of the consecutive ones property with applications
• scientific article; zbMATH DE number 5606342 (Why is no real title available?)
• Consecutive ones and a betweenness problem in computational biology
• scientific article; zbMATH DE number 15401 (Why is no real title available?)
• A bad submatrix is easy to find
• scientific article; zbMATH DE number 1953198 (Why is no real title available?)
• A note on consecutive ones in a binary matrix
• scientific article; zbMATH DE number 2196283 (Why is no real title available?)
• A certifying algorithm for the consecutive-ones property
• A new characterization of matrices with the consecutive ones property

This page was built for publication: Polyhedral aspects of the consecutive ones problem

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