Constructive dual methods for discrete programming (Q1101341): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 37 / rank | |||
Normal rank | |||
Revision as of 02:13, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructive dual methods for discrete programming |
scientific article |
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
