Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull

Kobe Grobben, Phablo F. S. Moura, Hande Yaman

This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knaps…