Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952)
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: Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
scientific article; zbMATH DE number 2117546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
scientific article; zbMATH DE number 2117546 |
Statements
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (English)
0 references
22 November 2004
0 references
Integer programming
0 references
Multiple objective programming
0 references
\(\varepsilon\)-Nondominated solution
0 references
LP-based heuristic
0 references
Knapsack problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
