Attacking the market split problem with lattice point enumeration
From MaRDI portal
Publication:702346
DOI10.1023/A:1013355015853zbMath1056.90106MaRDI QIDQ702346
Publication date: 17 January 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
integer linear programminglattice point enumerationlattice basis reductionsubset sum problemlinear Diophantine systemsMarket split problem
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Linear Diophantine equations (11D04)
Related Items (9)
Properties of codes with two homogeneous weights ⋮ Towards the classification of self-dual bent functions in eight variables ⋮ On the Consistent Path Problem ⋮ Solving market split problems with heuristical lattice reduction ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ Construction of binary and ternary self-orthogonal linear codes ⋮ On the classification of unitals on 28 points of low rank ⋮ A new lower bound for the football pool problem for six matches ⋮ Search for combinatorial objects using lattice algorithms -- revisited
This page was built for publication: Attacking the market split problem with lattice point enumeration
