On the complexity of discrete programming problems (Q5592807)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3312378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of discrete programming problems |
scientific article; zbMATH DE number 3312378 |
Statements
1969
0 references
algorithmic complexity
0 references
discrete integer programming
0 references
linear-separating algorithms
0 references
L-S algorithm
0 references
lower bounds
0 references
number of comparisons
0 references
complexity indices
0 references
0 references
On the complexity of discrete programming problems (English)
0 references
