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

@article{Hemmecke2006ComputingHI,
  title={Computing holes in semi-groups and its applications to transportation problems},
  author={Raymond Hemmecke and Akimichi Takemura and Ruriko Yoshida},
  journal={Contributions to Discrete Mathematics},
  year={2006},
  volume={4}
}
  • Raymond Hemmecke, Akimichi Takemura, Ruriko Yoshida
  • Published in
    Contributions to Discrete…
    2006
  • Mathematics, Computer Science
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-9 OF 9 CITATIONS