Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (Q1383928)
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 1139745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem |
scientific article; zbMATH DE number 1139745 |
Statements
Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (English)
0 references
5 August 1998
0 references
combinatorial optimization
0 references
multiobjective programming
0 references
knapsack problem
0 references
0-1 knapsack problem
0 references
two objectives
0 references
efficient solutions
0 references
0.8939065
0 references
0.89119375
0 references
0.88966423
0 references
0.88915396
0 references
0.8836749
0 references
0.88329005
0 references
0.8817128
0 references
