Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions.
Rupert LiPublished in: CoRR (2022)
Keyphrases
- linear programming
- primal dual
- algorithm for linear programming
- duality gap
- linear program
- dual variables
- upper bound
- optimal solution
- lower bound
- dynamic programming
- column generation
- packing problem
- finite number
- integer programming
- error bounds
- nonlinear programming
- data sets
- feasible solution
- upper and lower bounds
- discrete version
- np hard
- tight bounds
- efficient computation
- continuous variables
- lower and upper bounds
- valid inequalities
- decision variables
- worst case
- objective function