A study of lattice reformulations for integer programming

DOI10.1016/J.ORL.2023.05.001MaRDI QIDQ6047692zbMATH OpenOpenAlexFDO

Authors Karen Aardal, Lara Scavuzzo, Laurence A. Wolsey

Publication date 12 September 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

branching on general disjunctionsinteger optimizationlattice-based reformulation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5506108
• Lattice reformulation cuts
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra

Cites work

• A branch-and-bound algorithm for hard multiple knapsack problems
• A Class of Hard Small 0-1 Programs
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• Branching on general disjunctions
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Branching rules revisited
• Column basis reduction and decomposable knapsack problems
• Factoring polynomials with rational coefficients
• Hard Equality Constrained Integer Knapsacks
• scientific article; zbMATH DE number 5532102 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Improved branching disjunctions for branch-and-bound: an analytic center approach
• Integer Programming with a Fixed Number of Variables
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• The Generalized Basis Reduction Algorithm

Cited in

(2)

• scientific article; zbMATH DE number 5506108 (Why is no real title available?)
• scientific article; zbMATH DE number 5165610 (Why is no real title available?)

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

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