Pages that link to "Item:Q3953557"
From MaRDI portal
The following pages link to Random polytopes: Their definition, generation and aggregate properties (Q3953557):
Displaying 14 items.
- An optimal algorithm for realizing a Delaunay triangulation (Q287080) (← links)
- Weighted Poisson cells as models for random convex~polytopes (Q479144) (← links)
- Uniform distributions in a class of convex polyhedrons with applications to drug combination studies (Q1026371) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- On the asymptotic average number of efficient vertices in multiple objective linear programming (Q1273733) (← links)
- Random projections for quadratic programs (Q2196316) (← links)
- Intrinsic volumes of symmetric cones and applications in convex programming (Q2515035) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) (← links)
- Random linear programs with many variables and few constraints (Q3710288) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880) (← links)
- The expected number of extreme points of a random linear program (Q4726040) (← links)
