When two-constraint binary knapsack problem is equivalent to classical knapsack problem? (Q2080121)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: When two-constraint binary knapsack problem is equivalent to classical knapsack problem? |
scientific article; zbMATH DE number 7597761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When two-constraint binary knapsack problem is equivalent to classical knapsack problem? |
scientific article; zbMATH DE number 7597761 |
Statements
When two-constraint binary knapsack problem is equivalent to classical knapsack problem? (English)
0 references
7 October 2022
0 references
combinatorial optimization
0 references
knapsack problems
0 references
probabilistic analysis
0 references
Lagrange function
0 references
constraints activity
0 references
0 references
