Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065)
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: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial |
scientific article; zbMATH DE number 110392
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial |
scientific article; zbMATH DE number 110392 |
Statements
Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (English)
0 references
4 February 1993
0 references
global optimization
0 references
probabilistic analysis
0 references
average number of steps
0 references
parametric simplex algorithms
0 references
bilinear-programming
0 references
0 references
0 references
0 references
0 references
0 references
