On the complexity of integer programming
From MaRDI portal
Publication:3922169
DOI10.1145/322276.322287zbMath0468.68050MaRDI QIDQ3922169
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322276.322287
Related Items
Machines Over the Reals and Non-Uniformity, Decision Procedures for Multisets with Cardinality Constraints, On the complexity of recognizing the Hilbert basis of a linear Diophantine system, The complexity of the satisfiability problem for Krom formulas, Deciding Boolean algebra with Presburger arithmetic, Approximation algorithms for Hamming clustering problems, An appraisal of computational complexity for operations researchers, An expanding-core algorithm for the exact \(0-1\) knapsack problem, A genetic algorithm of determining cycle time for printed circuit board assembly lines, Length-bounded disjoint paths in planar graphs, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Decidable integration graphs., Minimal resolutions of lattice ideals and integer linear programming, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, On the complexity of achieving proportional representation, The complexity of finite model reasoning in description logics, Complexity of the two-variable fragment with counting quantifiers, Complexity of modal logics with Presburger constraints, Linear Arithmetic with Stars, An Analysis of Slow Convergence in Interval Propagation, Preprocessing composite cutting procedure: an approach to the integer model, Coalgebraic Hybrid Logic, A Sharp Bound for Solutions of Linear Diophantine Equations
