On the lattice programming gap of the group problems
Optimization and Control
2015-01-27 v2
Abstract
We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in terms of the cost vector and the determinant of the lattice.
Keywords
Cite
@article{arxiv.1404.6967,
title = {On the lattice programming gap of the group problems},
author = {Iskander Aliev},
journal= {arXiv preprint arXiv:1404.6967},
year = {2015}
}