Pages that link to "Item:Q1315430"

The following pages link to Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430):

Displaying 8 items.

• The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731) (← links)
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
• How good are convex hull algorithms? (Q1356937) (← links)
• (Q5009558) (← links)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
• Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
• Generating all vertices of a polyhedron is hard (Q5920505) (← links)