Computing holes in semi-groups and its applications to transportation problems

Details Computing holes in semi-groups and its applications to transportation problems Computing holes in semi-groups and its applications to transportation problems

2006-07-24

arxiv.org/abs/math/0607599v3

Mathematics

Combinatorics

Presentation has been improved according to comments by referees. This manuscript has been accepted to "Contributions to Discr

Scientific paper

An integer feasibility problem is a fundamental problem in many areas, such as operations research, number theory, and statistics. To study a family of systems with no nonnegative integer solution, we focus on a commutative semigroup generated by a finite set of vectors in $\Z^d$ and its saturation. In this paper we present an algorithm to compute an explicit description for the set of holes which is the difference of a semi-group $Q$ generated by the vectors and its saturation. We apply our procedure to compute an infinite family of holes for the semi-group of the $3\times 4\times 6$ transportation problem. Furthermore, we give an upper bound for the entries of the holes when the set of holes is finite. Finally, we present an algorithm to find all $Q$-minimal saturation points of $Q$.

Affiliated with

Also associated with

No associations

Rating

Computing holes in semi-groups and its applications to transportation problems 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 Computing holes in semi-groups and its applications to transportation problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing holes in semi-groups and its applications to transportation problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585753