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. The name is absent2. Momentum in Australian Stock Returns: An Update
3. Nonparametric cointegration analysis
4. Crime as a Social Cost of Poverty and Inequality: A Review Focusing on Developing Countries
5. The Structure Performance Hypothesis and The Efficient Structure Performance Hypothesis-Revisited: The Case of Agribusiness Commodity and Food Products Truck Carriers in the South
6. The name is absent
7. Experience, Innovation and Productivity - Empirical Evidence from Italy's Slowdown
8. Education Research Gender, Education and Development - A Partially Annotated and Selective Bibliography
9. Ventas callejeras y espacio público: efectos sobre el comercio de Bogotá
10. CAN CREDIT DEFAULT SWAPS PREDICT FINANCIAL CRISES? EMPIRICAL STUDY ON EMERGING MARKETS