Solving Multiple Knapsack Problems by Cutting Planes (Q4895625)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 935279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Multiple Knapsack Problems by Cutting Planes |
scientific article; zbMATH DE number 935279 |
Statements
Solving Multiple Knapsack Problems by Cutting Planes (English)
0 references
3 February 1997
0 references
branch and cut
0 references
multiple knapsack problem
0 references
cutting plane algorithm
0 references
design of main frame computers
0 references
layout of electronic circuits
0 references
0.8395729660987854
0 references
0.8344824314117432
0 references
0.825522243976593
0 references
