Pages that link to "Item:Q1219775"
From MaRDI portal
The following pages link to An algorithm for enumerating all vertices of a convex polyhedron (Q1219775):
Displayed 8 items.
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- On the Nipp polyhedron algorithm for solving singular perturbation problems (Q1349169) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- A validation and verification tool for global optimization solvers (Q3598649) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)