Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We consider dual pairs of packing and covering integer linear programs. Best possible bounds are found between their optimal values. Tight inequalities are obtained relating the integral optima and the optimal rational solutions.