One line and n points (Q4446873): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The worst-case running time of the random simplex algorithm is exponential in the height / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomized simplex algorithms on Klee-Minty cubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear programming, the simplex algorithm and simple polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3914762 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4217266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Entering and leaving \(j\)-facets / rank | |||
Normal rank |
Revision as of 13:42, 6 June 2024
scientific article; zbMATH DE number 2037530
Language | Label | Description | Also known as |
---|---|---|---|
English | One line and n points |
scientific article; zbMATH DE number 2037530 |
Statements
One line and n points (English)
0 references
3 February 2004
0 references
simplex algorithm
0 references
linear programming
0 references
random-edge pivot rule
0 references
randomization
0 references
0 references