Yang, Z. (Tilburg University, Center for Economic Research)
Abstract
Given an arbitrary polytope P in the n-dimensional Euclidean space R n , the question is to determine whether P contains an integral point or not. We propose a simplicial algorithm to answer this question based on a specifc integer labeling rule and a specific triangulation of R n . Starting from an arbitrary integral point ofR n , the algorithm terminates within a finite number of steps with either an integral point in P or proving there is no integral point inP. One prominent feature of the algorithm is that the structure of the algorithm is very simple and itcanbeeasily implemented on a computer. Moreover, the algorithm is computationally very simple, exible and stable.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
89.
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Related research
Keywords:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: