Constructive dual methods for discrete programming (Q1101341)
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 4047445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructive dual methods for discrete programming |
scientific article; zbMATH DE number 4047445 |
Statements
Constructive dual methods for discrete programming (English)
0 references
1987
0 references
constructive dual methods
0 references
discrete programming
0 references
reduction of the feasibility set
0 references
no duality gap
0 references
relaxation approximation
0 references
knapsack problems
0 references
0.7999855875968933
0 references
0.7635729908943176
0 references
