A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542)
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: A polynomial algorithm for integer programming covering problems satisfying the integer round-up property |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for integer programming covering problems satisfying the integer round-up property |
scientific article |
Statements
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (English)
0 references
1982
0 references
integer round-up property
0 references
generalized covering problem
0 references
polynomial time algorithm
0 references
