Thinner is not always better: cascade knapsack problems

DOI10.1016/j.orl.2016.12.005zbMath1409.90230arXiv1612.08588OpenAlexW2567428825MaRDI QIDQ1727953

Bala Krishnamoorthy

Publication date: 21 February 2019

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

Full work available at URL: https://arxiv.org/abs/1612.08588

zbMATH Keywords

branch-and-boundcolumn basis reductionhyperplane branchingthin direction

Mathematics Subject Classification ID

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

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Column basis reduction and decomposable knapsack problems
• Lattice based extended formulations for integer linear equality systems
• Bounds on the size of branch-and-bound proofs for integer knapsacks
• A hierarchy of polynomial time lattice basis reduction algorithms
• 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
• On the Complexity of Selecting Disjunctions in Integer Programming
• Hard Knapsack Problems
• The Generalized Basis Reduction Algorithm
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
• Trivial integer programs unsolvable by branch-and-bound
• Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
• Hard Equality Constrained Integer Knapsacks

This page was built for publication: Thinner is not always better: cascade knapsack problems