Integer programming as a framework for optimization and approximability
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Expressing combinatorial optimization problems by Linear ProgramsPublished by Elsevier ,2003
- Approximating bounded 0-1 integer linear programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interactive proofs and approximation: reductions from two provers in one roundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On Syntactic versus Computational Views of ApproximabilitySIAM Journal on Computing, 1998
- The complexity and approximability of finding maximum feasible subsystems of linear relationsTheoretical Computer Science, 1995
- Approximation Properties of NP Minimization ClassesJournal of Computer and System Sciences, 1995
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequalityMathematical Programming, 1993
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Quantifiers and approximationPublished by Association for Computing Machinery (ACM) ,1990
- Integer programming formulation of combinatorial optimization problemsDiscrete Mathematics, 1976