Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Infeasible interior-point methods for linear optimization based on large neighborhood |
scientific article; zbMATH DE number 6621008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infeasible interior-point methods for linear optimization based on large neighborhood |
scientific article; zbMATH DE number 6621008 |
Statements
Infeasible interior-point methods for linear optimization based on large neighborhood (English)
0 references
31 August 2016
0 references
linear optimization
0 references
primal-dual infeasible interior-point methods
0 references
polynomial algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8390817642211914
0 references
0.82411789894104
0 references
0.8197042346000671
0 references
0.8174905180931091
0 references
