The Generalized Basis Reduction Algorithm
From MaRDI portal
Publication:4022031
DOI10.1287/moor.17.3.751zbMath0774.90060OpenAlexW2102738679MaRDI QIDQ4022031
László Lovász, Herbert E. Scarf
Publication date: 17 January 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://cowles.yale.edu/sites/default/files/files/pub/d09/d0946.pdf
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A fixed point iterative approach to integer programming and its distributed computation, Column basis reduction and decomposable knapsack problems, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Effective lattice point counting in rational convex polytopes, Segment LLL reduction of lattice bases using modular arithmetic, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, A study of lattice reformulations for integer programming, Bounds on area involving lattice size, Computing with an algebraic-perturbation variant of Barvinok's algorithm, A generalization of the integer linear infeasibility problem, Thinner is not always better: cascade knapsack problems, Rational orthogonal approximations to orthogonal matrices, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Non-standard approaches to integer programming, Branching on general disjunctions, Cryptographic Functions from Worst-Case Complexity Assumptions, Optimal routing in double loop networks, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, Lattice size and generalized basis reduction in dimension three, On the Structure of Reduced Kernel Lattice Bases, Analysis of PSLQ, an integer relation finding algorithm, Unnamed Item, Lattice Size of Plane Convex Bodies
