Test Sets for Integer Programs with Z-Convex Objective

Details Test Sets for Integer Programs with Z-Convex Objective Test Sets for Integer Programs with Z-Convex Objective

2003-09-08

arxiv.org/abs/math/0309154v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Test Sets for Integer Programs with Z-Convex Objective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Test Sets for Integer Programs with Z-Convex Objective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Test Sets for Integer Programs with Z-Convex Objective will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390576