Optima of dual integer linear programs
DOI10.1007/BF02122549zbMATH Open0648.90054OpenAlexW2093321189WikidataQ105659276 ScholiaQ105659276MaRDI QIDQ1105488FDOQ1105488
Authors: Ron Aharoni, Nathan Linial, P. Erdős
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02122549
Recommendations
Linear programming (90C05) Combinatorial optimization (90C27) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (12)
- Title not available (Why is that?)
- The maximum clique problem
- New class of 0-1 integer programs with tight approximation via linear relaxations
- On the relationship between the optima of linear and integer linear programming
- Title not available (Why is that?)
- Classes of linear programs with integral optimal solutions
- Title not available (Why is that?)
- Metric relations in integer-valued linear programming
- Linear programming bounds for codes via a covering argument
- Title not available (Why is that?)
- Combinatorial problems of packing and covering and related problems of integer linear program\-ming
- Improved parallel approximation of a class of integer programming problems
This page was built for publication: Optima of dual integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105488)