APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS (Q3863692): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:02, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS |
scientific article |
Statements
APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS (English)
0 references
1980
0 references
approximate algorithms
0 references
multiple-choice continuous knapsack problems
0 references
breadth-1 search method
0 references
breadth-K search method
0 references
NP-complete problem
0 references
