Solving market split problems with heuristical lattice reduction

DOI10.1007/s10479-012-1143-0zbMath1269.90063OpenAlexW2060063583MaRDI QIDQ1761840

Heiko Vogel

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1143-0

zbMATH Keywords

lattice reductionheuristic evaluation

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Attacking the market split problem with lattice point enumeration
• 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
• Improved low-density subset sum algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Sieve algorithms for the shortest vector problem are practical
• A Class of Hard Small 0-1 Programs

This page was built for publication: Solving market split problems with heuristical lattice reduction