2000 character limit reached
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices (1707.03914v1)
Published 12 Jul 2017 in cs.DS
Abstract: We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})={x\in\RRn \mid Ax\geq \b1,~x\geq \b0}$, when $A$ is a totally unimodular matrix. Our algorithm is based on decomposing the hypergraph transversal problem for unimodular hypergraphs using Seymour's decomposition of totally unimodular matrices, and may be of independent interest.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.