The Set-Covering Problem: A New Implicit Enumeration Algorithm (Q4162967): 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.1287/opre.25.5.760 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2158446314 / rank | |||
Normal rank | |||
Latest revision as of 01:03, 20 March 2024
scientific article; zbMATH DE number 3596581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Set-Covering Problem: A New Implicit Enumeration Algorithm |
scientific article; zbMATH DE number 3596581 |
Statements
The Set-Covering Problem: A New Implicit Enumeration Algorithm (English)
0 references
1977
0 references
