Abstract Given an arbitrary polytope P in the п-dimensional Euclidean
space Rn, 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 specific integer labeling rule and a specific triangulation
of Rn. Starting from an arbitrary integral point of K'. the algorithm
terminates within a finite number of steps with either an integral point
in P or proving there is no integral point in P. One prominent feature
of the algorithm is that the structure of the algorithm is very simple and
it can be easily implemented on a computer. Moreover, the algorithm
is computationally very simple, flexible and stable.
Keywords: Polytope, integral point, simplicial method, integer linear
programming.
More intriguing information
1. Are combination forecasts of S&P 500 volatility statistically superior?2. The name is absent
3. From music student to professional: the process of transition
4. Emissions Trading, Electricity Industry Restructuring and Investment in Pollution Abatement
5. Party Groups and Policy Positions in the European Parliament
6. Permanent and Transitory Policy Shocks in an Empirical Macro Model with Asymmetric Information
7. The name is absent
8. The name is absent
9. Towards a Strategy for Improving Agricultural Inputs Markets in Africa
10. The name is absent