AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (Q3931021): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:08, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS |
scientific article |
Statements
AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (English)
0 references
1981
0 references
cutting plane algorithm
0 references
0-1 bilinear knapsack problem
0 references
integer quadratic programming
0 references
bipartite matching
0 references
multi-attribute utility analysis
0 references
cutting stock problems
0 references
