Pages that link to "Item:Q3313620"
From MaRDI portal
The following pages link to The Complexity of Vertex Enumeration Methods (Q3313620):
Displaying 8 items.
- Forbidden Vertices (Q5252224) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
- Double description method revisited (Q6567674) (← links)
- Some applications of combinatorial optimization in parallel computing (Q6567695) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)