CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS (Q3724093)
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 3954652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS |
scientific article; zbMATH DE number 3954652 |
Statements
CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS (English)
0 references
1985
0 references
fast algorithms
0 references
feasibility and periodicity problems
0 references
equality constrained knapsack problem
0 references
F-tree
0 references
shortest path spanning tree
0 references
P-tree
0 references
0.8170626163482666
0 references
0.8032535910606384
0 references
0.7917614579200745
0 references
0.7809121012687683
0 references
