Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1992.74 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087785683 / rank | |||
Normal rank | |||
Latest revision as of 19:18, 19 March 2024
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
