Computing the Integer Programming Gap
最优化与控制
2007-05-23 v1 交换代数
组合数学
摘要
We determine the maximal gap between the optimal values of an integer program and its linear programming relaxation, where the matrix and cost function are fixed but the right hand side is unspecified. Our formula involves irreducible decomposition of monomial ideals. The gap can be computed in polynomial time when the dimension is fixed.
引用
@article{arxiv.math/0301266,
title = {Computing the Integer Programming Gap},
author = {Serkan Hosten and Bernd Sturmfels},
journal= {arXiv preprint arXiv:math/0301266},
year = {2007}
}
备注
17 Pages