AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (Q3931021): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.15807/jorsj.24.360 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2182349857 / rank | |||
Normal rank | |||
Latest revision as of 02:19, 20 March 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
