Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373)
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: Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems |
scientific article; zbMATH DE number 6633518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems |
scientific article; zbMATH DE number 6633518 |
Statements
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (English)
0 references
6 October 2016
0 references
combinatorial optimization
0 references
multiple objective programming
0 references
bi-dimensional binary knapsack problem
0 references
surrogate relaxation
0 references
bound sets
0 references
0 references
0 references
0 references
0 references
0 references
0 references
