A new polynomial-time algorithm for linear programming
Combinatorica
Computing the volume is difficult
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Hermite normal form computation using modulo determinant arithmetic
Mathematics of Operations Research
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Discrete optimization
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the complexity of computing the volume of a polyhedron
SIAM Journal on Computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Experiments in quadratic 0-1 programming
Mathematical Programming: Series A and B
Large-scale 0-1 linear programming on distributed workstations
Annals of Operations Research
Optimization
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Introduction to the IBM optimization subroutine library
IBM Systems Journal
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Lehman's forbidden minor characterization of ideal 0–1 matrices
Discrete Mathematics
Testing balancedness and perfection of linear matrices
Mathematical Programming: Series A and B
Journal of Combinatorial Theory Series B
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
A Fast Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
Principles and Practice of Constraint Programming
Principles and Practice of Constraint Programming
Principles and Practice of Constraint Programming: Proceedings of the Second International Workshop, PPCR '94, Rosario, Orcas Island, WA, U. S. A., May 2-4, 1994
Mathematical Programming Embeddings of Logic
Journal of Automated Reasoning
Integrated Methods for Optimization (International Series in Operations Research & Management Science)
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A class of logic problems solvable by linear programming
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture the feasible set of alternatives, and linear objective functions (to minimize or maximize over the feasible set) that specify the criterion for defining optimality. This algebraic approach permits certain natural extensions of the powerful methodologies of linear programming to be brought to bear on combinatorial optimization and on fundamental algorithmic questions in the geometry of numbers.