A Polynomial Algorithm for the Two-Variable Integer Programming Problem (Q3858024): Difference between revisions
From MaRDI portal
Changed an 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.1145/322169.322179 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112960677 / rank | |||
Normal rank | |||
Latest revision as of 21:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Algorithm for the Two-Variable Integer Programming Problem |
scientific article |
Statements
A Polynomial Algorithm for the Two-Variable Integer Programming Problem (English)
0 references
1980
0 references
polynomial algorithm
0 references
two-variable integer programming
0 references
knapsack problem
0 references
coefficient size
0 references
feasible region decomposition
0 references
computational complexity
0 references
