Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (Q3875704)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3679549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study |
scientific article; zbMATH DE number 3679549 |
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
