Arrow Research search
Back to STOC

STOC 1985

Dual Integer Linear Programs and the Relationship between their Optima

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
420730905151145140
v2026.09.13