An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem |
scientific article; zbMATH DE number 1123708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem |
scientific article; zbMATH DE number 1123708 |
Statements
An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (English)
0 references
4 March 1998
0 references
elastic programming
0 references
irreducible infeasible sets
0 references
heuristic algorithm
0 references
0 references
