Optima of dual integer linear programs

DOI10.1007/BF02122549zbMath0648.90054OpenAlexW2093321189WikidataQ105659276 ScholiaQ105659276MaRDI QIDQ1105488

Ron Aharoni, Nathan Linial

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122549

zbMATH Keywords

packingcovering integer linear programspair of linear programs

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Improved parallel approximation of a class of integer programming problems ⋮ Linear programming bounds for codes via a covering argument ⋮ The maximum clique problem

Cites Work

• Decomposition of regular matroids
• Maximum degree and fractional matchings in uniform hypergraphs
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Optima of dual integer linear programs