Column basis reduction and decomposable knapsack problems
From MaRDI portal
Publication:834182
DOI10.1016/j.disopt.2009.01.003zbMath1176.90418arXiv0807.1317OpenAlexW2064684117MaRDI QIDQ834182
Bala Krishnamoorthy, Gábor Pataki
Publication date: 19 August 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.1317
Related Items
Multivariable Branching: A 0-1 Knapsack Problem Case Study, Lattice-based algorithms for number partitioning in the hard phase, A study of lattice reformulations for integer programming, Sparse recovery with integrality constraints, Thinner is not always better: cascade knapsack problems, Lattice Reformulation Cuts, Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations, Integer Programming for Classifying Orthogonal Arrays, Unnamed Item, On the Structure of Reduced Kernel Lattice Bases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Decomposition of integer programs and of generating sets
- Chvátal closures for mixed integer programming problems
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- On the separation of split cuts and related inequalities
- A primal all-integer algorithm based on irreducible solutions
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Effective lattice point counting in rational convex polytopes
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Integer Programming with a Fixed Number of Variables
- Computing the Continuous Discretely
- Minkowski's Convex Body Theorem and Integer Programming
- Hard Knapsack Problems
- The Generalized Basis Reduction Algorithm
- Disjunctive Programming
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- A Class of Hard Small 0-1 Programs
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Trivial integer programs unsolvable by branch-and-bound
- Equivalent Integer Programs and Canonical Problems
- Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
- Hard Equality Constrained Integer Knapsacks
