Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848)
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 bicriteria 0--1 knapsack problems using a labeling algorithm. |
scientific article; zbMATH DE number 2005395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving bicriteria 0--1 knapsack problems using a labeling algorithm. |
scientific article; zbMATH DE number 2005395 |
Statements
Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (English)
0 references
17 November 2003
0 references
Bicriteria knapsack problem
0 references
Bicriteria shortest path problem
0 references
Labeling algorithms
0 references
0 references
