Pages that link to "Item:Q5704196"
From MaRDI portal
The following pages link to Hard Equality Constrained Integer Knapsacks (Q5704196):
Displaying 16 items.
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- Testing integer knapsacks for feasibility (Q1266633) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- LLL-reduction for integer knapsacks (Q1928499) (← links)
- The generic Gröbner walk (Q2457423) (← links)
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection (Q2469234) (← links)
- (Q5092485) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)