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. Handling the measurement error problem by means of panel data: Moment methods applied on firm data2. Opciones de política económica en el Perú 2011-2015
3. The name is absent
4. Industrial Cores and Peripheries in Brazil
5. Regional Intergration and Migration: An Economic Geography Model with Hetergenous Labour Force
6. Nietzsche, immortality, singularity and eternal recurrence1
7. Firm Closure, Financial Losses and the Consequences for an Entrepreneurial Restart
8. Strategic Planning on the Local Level As a Factor of Rural Development in the Republic of Serbia
9. The geography of collaborative knowledge production: entropy techniques and results for the European Union
10. Ability grouping in the secondary school: attitudes of teachers of practically based subjects