A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931)
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 4068613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem |
scientific article; zbMATH DE number 4068613 |
Statements
A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (English)
0 references
1988
0 references
An algorithm for a quadratic multidimensional knapsack problem is described in the paper. It is based on surrogate relaxation and new efficient procedures for finding surrogate multipliers and a good lower bound. Enumeration criteria are developed.
0 references
quadratic multidimensional knapsack problem
0 references
surrogate relaxation
0 references
surrogate multipliers
0 references
0 references
0.8500937223434448
0 references
0.8437392711639404
0 references
0.8216903209686279
0 references
0.8067215085029602
0 references
0.8012463450431824
0 references
