Characterizing noninteger polyhedra with 0-1 constraints

DOI10.1007/3-540-69346-7_4MaRDI QIDQ3840345zbMATH OpenFDO

Authors András Sebö

Publication date 8 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69346-7_4

zbMATH Keywords

incidence matrixodd circuit graphset-covering polyhedronset-packing

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2084719
• On 0/1-polytopes with nonobtuse triangulations
• On some characterizations of convex polyhedra
• On integer polytopes with few nonzero vertices
• scientific article; zbMATH DE number 5956571
• scientific article; zbMATH DE number 2156778
• Nondegeneracy of polyhedra and linear programs
• scientific article; zbMATH DE number 6008341
• On nontriangulable polyhedra
• Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

Cited in

(6)

• Non-regular square bipartite designs
• The matching relaxation for a class of generalized set partitioning problems
• On the mixed set covering, packing and partitioning polytope
• An extension of Lehman's theorem and ideal set functions
• scientific article; zbMATH DE number 6008341 (Why is no real title available?)
• Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

This page was built for publication: Characterizing noninteger polyhedra with 0-1 constraints

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