Integer programming as a framework for optimization and approximability (Q1276163): Difference between revisions

@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283229
@@ Property / cites work: Q4283229 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
+Normal rank
@@ Property / cites work @@
+Integer programming formulation of combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Logical definability of NP optimization problems
@@ Property / cites work: Logical definability of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation properties of NP minimization classes
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The approximability of non-Boolean satisfiability problems and restricted integer programming
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank