Test Sets for Integer Programs with Z-Convex Objective
From MaRDI portal
Abstract: 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.
This page was built for publication: Test Sets for Integer Programs with Z-Convex Objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473139)
