The name is absent



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. Citizenship
2. The Impact of Financial Openness on Economic Integration: Evidence from the Europe and the Cis
3. Individual tradable permit market and traffic congestion: An experimental study
4. Testing Panel Data Regression Models with Spatial Error Correlation
5. ESTIMATION OF EFFICIENT REGRESSION MODELS FOR APPLIED AGRICULTURAL ECONOMICS RESEARCH
6. Climate change, mitigation and adaptation: the case of the Murray–Darling Basin in Australia
7. The name is absent
8. ISSUES AND PROBLEMS OF IMMEDIATE CONCERN
9. Strategic Policy Options to Improve Irrigation Water Allocation Efficiency: Analysis on Egypt and Morocco
10. 101 Proposals to reform the Stability and Growth Pact. Why so many? A Survey