Pages that link to "Item:Q3872190"
From MaRDI portal
The following pages link to Computational results on an algorithm for finding all vertices of a polytope (Q3872190):
Displaying 11 items.
- Evolution, games theory and polyhedra (Q1096563) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- An improved vertex enumeration algorithm (Q1160560) (← links)
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\). (Q1165469) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- Constructing the set of efficient objective values in linear multiple objective transportation problems (Q1328608) (← links)
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals (Q1602997) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- The expected number of extreme points of a random linear program (Q4726040) (← links)
