Pages that link to "Item:Q1272311"

The following pages link to The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311):

Displaying 12 items.

• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
• Enumerating trichromatic triangles containing the origin in linear time (Q2376788) (← links)
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search (Q4605440) (← links)
• Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
• (Q5009558) (← links)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
• Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
• Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection (Q5387636) (← links)
• FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
• Generating all vertices of a polyhedron is hard (Q5920505) (← links)