A study of lattice reformulations for integer programming

DOI10.1016/j.orl.2023.05.001zbMath1525.90269OpenAlexW4381460227MaRDI QIDQ6047692

Lara Scavuzzo, Karen Aardal, Laurence A. Wolsey

Publication date: 12 September 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2023.05.001

zbMATH Keywords

integer optimizationbranching on general disjunctionslattice-based reformulation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved branching disjunctions for branch-and-bound: an analytic center approach
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Branching on general disjunctions
• A branch-and-bound algorithm for hard multiple knapsack problems
• Column basis reduction and decomposable knapsack problems
• Factoring polynomials with rational coefficients
• Branching rules revisited
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
• Integer Programming with a Fixed Number of Variables
• The Generalized Basis Reduction Algorithm
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• A Class of Hard Small 0-1 Programs
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Hard Equality Constrained Integer Knapsacks

This page was built for publication: A study of lattice reformulations for integer programming