Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints |
scientific article |
Statements
Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (English)
0 references
1990
0 references
This paper shows how stronger valid inequalities for the knapsack problem with generalized upper bound constraints can be obtained and how to generate violated inequalities for use in a cutting plane algorithm.
0 references
valid inequalities
0 references
knapsack problem
0 references
generalized upper bound constraints
0 references
cutting plane algorithm
0 references
