The central path visits all the vertices of the Klee–Minty cube (Q3423600): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4339096 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5691079 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the number of iterations of long-step primal-dual linear programming algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds / rank | |||
Normal rank | |||
Latest revision as of 13:30, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The central path visits all the vertices of the Klee–Minty cube |
scientific article |
Statements
The central path visits all the vertices of the Klee–Minty cube (English)
0 references
14 February 2007
0 references
linear programming
0 references
central path
0 references
Klee-Minty cube
0 references
0 references
