Test Sets for Integer Programs with Z-Convex Objective
组合数学
2007-05-23 v1
摘要
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by providing an explicit relationship to Graver bases. One candidate where this new approach may turn out fruitful is the Quadratic Assignment Problem.
引用
@article{arxiv.math/0309154,
title = {Test Sets for Integer Programs with Z-Convex Objective},
author = {Raymond Hemmecke},
journal= {arXiv preprint arXiv:math/0309154},
year = {2007}
}