Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems (Q5641000): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.19.4.998 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972106066 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:43, 19 March 2024
scientific article; zbMATH DE number 3368462
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems |
scientific article; zbMATH DE number 3368462 |
Statements
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems (English)
0 references
1971
0 references
