Integer programming as a framework for optimization and approximability

DOI10.1006/JCSS.1998.1584MaRDI QIDQ1276163zbMATH OpenOpenAlexFDO

Authors Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur

Publication date 15 June 1999

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/58acdba60120d4079f41b7bfbfc77dfaaa64ae5a

zbMATH Keywords

structural approximation theory

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Approximability of Integer Programming with Generalised Constraints
• Using structural properties for integer programs
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• scientific article; zbMATH DE number 515727

Cites work

• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• scientific article; zbMATH DE number 515727 (Why is no real title available?)
• Approximation algorithms for combinatorial problems
• Approximation properties of NP minimization classes
• Expressing combinatorial optimization problems by linear programs
• Integer programming formulation of combinatorial optimization problems
• Logical definability of NP optimization problems
• On Syntactic versus Computational Views of Approximability
• Optimization, approximation, and complexity classes
• The approximability of non-Boolean satisfiability problems and restricted integer programming
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Cited in

(25)

• Evolution and state-of-the-art in integer programming
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
• scientific article; zbMATH DE number 4033489 (Why is no real title available?)
• Theory and Applications of n-Fold Integer Programming
• Perspectives on integer programming for time-dependent models
• Future paths for integer programming and links to artificial intelligence
• Compact representation of near-optimal integer programming solutions
• The approximability of non-Boolean satisfiability problems and restricted integer programming
• An integral transformation for integer programming problems
• Computational integer programming
• Using structural properties for integer programs
• Applications of integer programming methods to cages
• Integer programming approaches for minimum stabbing problems
• Integer programming in parameterized complexity: five miniatures
• scientific article; zbMATH DE number 4001344 (Why is no real title available?)
• scientific article; zbMATH DE number 5761488 (Why is no real title available?)
• Integer Programming: Optimization and Evaluation Are Equivalent
• Approximating integer programs with positive right-hand sides
• Experimental Results on the New Techniques for Integer Programming Formulations
• scientific article; zbMATH DE number 3873105 (Why is no real title available?)
• Integer programming and related areas. A classified bibliography 1981 - 1984. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
• La valeur optimale des programmes entiers. (The optimal value of integer programs)
• A unified framework for a class of mathematical programming problems
• General purpose heuristics for integer programming. II
• Combinatorial \(n\)-fold integer programming and applications

This page was built for publication: Integer programming as a framework for optimization and approximability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276163)