Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995)
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: Using dual network bounds in algorithms for solving generalized set packing/partitioning problems |
scientific article; zbMATH DE number 941247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using dual network bounds in algorithms for solving generalized set packing/partitioning problems |
scientific article; zbMATH DE number 941247 |
Statements
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (English)
0 references
15 December 1996
0 references
dual bounds
0 references
approximate solutions
0 references
generalized set packing/partitioning problems
0 references
branch-and-bound
0 references
network relaxation
0 references
