A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229)
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: A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems |
scientific article; zbMATH DE number 3876928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems |
scientific article; zbMATH DE number 3876928 |
Statements
A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (English)
0 references
1984
0 references
equivalent problem transformation
0 references
combinatorial optimization
0 references
equality constrained
0 references
knapsack problems
0 references
constrained shortest path problems
0 references
0.7849252820014954
0 references
0.7561423182487488
0 references
0.7558196187019348
0 references
