Primal–Dual Algorithms for Precedence Constrained Covering Problems

A covering problem is an integer linear program of type \(\min \{c^Tx\mid Ax\ge D,\ 0\le x\le d,\ x \in \mathbb {Z}\}\) where \(A\in \mathbb {Z}^{m\t...
1 downloads 420 Views 491KB Size