Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (Q3875704): 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.1007/bfb0120886 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1573881838 / rank | |||
Normal rank | |||
Revision as of 09:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study |
scientific article |
Statements
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (English)
0 references
1980
0 references
set covering algorithms
0 references
cutting planes, heuristics
0 references
subgradient optimization
0 references
computational study
0 references
implementation
0 references
computational testing
0 references
prime covers
0 references
lower bounds
0 references
implicit enumeration
0 references
branching rules
0 references
branch and bound
0 references
conditional bounds
0 references
random test problems
0 references
comparison of algorithms
0 references
