A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
- 1 December 1982
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 22 (1), 231-235
- https://doi.org/10.1007/bf01581039
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Finite checkability for integer rounding properties in combinatorial programming problemsMathematical Programming, 1982