Solving market split problems with heuristical lattice reduction
From MaRDI portal
Publication:1761840
Recommendations
- Attacking the market split problem with lattice point enumeration
- scientific article; zbMATH DE number 1342116
- On the structure of reduced kernel lattice bases
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
Cites work
- scientific article; zbMATH DE number 1187155 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- A Class of Hard Small 0-1 Programs
- A hierarchy of polynomial time lattice basis reduction algorithms
- Attacking the market split problem with lattice point enumeration
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On Lovász' lattice reduction and the nearest lattice point problem
- Sieve algorithms for the shortest vector problem are practical
Cited in
(5)- Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Comments on the paper: ``Attacking the market split problem with lattice point enumeration by A. Wasserman.
- Solving the market split problem via branch-and-cut
- Attacking the market split problem with lattice point enumeration
This page was built for publication: Solving market split problems with heuristical lattice reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761840)
