Integer programming as a framework for optimization and approximability
type: Item
instance of: scholarly article
title: Integer programming as a framework for optimization and approximability
zbMATH Open document ID: 0915.90212
author: Ian Barland
author: Phokion G. Kolaitis
author: Madhukar N. Thakur
published in: Journal of Computer and System Sciences
publication date: 1999-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1240646
zbMATH Keywords: structural approximation theory
MaRDI profile type: Publication
OpenAlex ID: W2086176558
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: Q4230322
cites work: Q4230321
cites work: Q4283229
cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
cites work: Integer programming formulation of combinatorial optimization problems
cites work: Approximation algorithms for combinatorial problems
cites work: On Syntactic versus Computational Views of Approximability
cites work: Logical definability of NP optimization problems
cites work: Approximation properties of NP minimization classes
cites work: Optimization, approximation, and complexity classes
cites work: The approximability of non-Boolean satisfiability problems and restricted integer programming
cites work: Expressing combinatorial optimization problems by linear programs
DOI: 10.1006/JCSS.1998.1584
description: scientific article; zbMATH DE number 1240646