An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming

DOI10.1287/IJOC.5.2.206MaRDI QIDQ4202587zbMATH OpenOpenAlexFDO

Authors Thomas F. Rutherford, Herbert Scarf, David F. Shallcross, William Cook

Publication date 3 January 1994

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://cowles.yale.edu/sites/default/files/files/pub/d09/d0990.pdf

zbMATH Keywords

generalized basis reduction methodpolynomial-time algorithm

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• The Generalized Basis Reduction Algorithm
• scientific article; zbMATH DE number 4051349
• scientific article; zbMATH DE number 5165610
• scientific article; zbMATH DE number 2159268
• Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs

Cited in

(17)

• Thinner is not always better: cascade knapsack problems
• Parametric formulation of the general integer linear programming problem
• Could we use a million cores to solve an integer program?
• Effective lattice point counting in rational convex polytopes
• Improved branching disjunctions for branch-and-bound: an analytic center approach
• scientific article; zbMATH DE number 3845347 (Why is no real title available?)
• Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite
• Lattice reformulation cuts
• On the structure of reduced kernel lattice bases
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
• Fast integer programming in fixed dimension
• A framework for constructing general integer problems with well-determined duality gaps
• A study of lattice reformulations for integer programming
• Non-standard approaches to integer programming
• Column basis reduction and decomposable knapsack problems
• A generalization of the integer linear infeasibility problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202587)