Shortest path algorithms for knapsack type problems (Q4123080)
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 3548725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path algorithms for knapsack type problems |
scientific article; zbMATH DE number 3548725 |
Statements
Shortest path algorithms for knapsack type problems (English)
0 references
1976
0 references
