Pages that link to "Item:Q2471066"
From MaRDI portal
The following pages link to The use of edge-directions and linear programming to enumerate vertices (Q2471066):
Displaying 5 items.
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)