Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535)
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: Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations |
scientific article |
Statements
Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (English)
0 references
16 January 1993
0 references
discrete optimization
0 references
branch and bound
0 references
graph theoretic relaxations
0 references
tree search algorithms
0 references
set-covering
0 references
set-partitioning
0 references
assignment relaxations
0 references
