Pages that link to "Item:Q834182"
From MaRDI portal
The following pages link to Column basis reduction and decomposable knapsack problems (Q834182):
Displaying 12 items.
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations (Q2261724) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- (Q5092485) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
