Linear programming in \(O(n\times 3^{d^2})\) time (Q2003407): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90037-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009436609 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / 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: Q3050157 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank | |||
Normal rank | |||
Latest revision as of 19:23, 19 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear programming in \(O(n\times 3^{d^2})\) time |
scientific article |
Statements
Linear programming in \(O(n\times 3^{d^2})\) time (English)
0 references
8 July 2019
0 references
