Loading...
A simplicial algorithm for testing the integral properties of polytopes: A revision
Yang,Z.F.
Yang,Z.F.
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.
Description
Pagination: 32, 11
Date
1994
Journal Title
Journal ISSN
Volume Title
Publisher
CentER, Center for Economic Research
Files
Loading...
89.pdf
Adobe PDF, 461.04 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Linear Programming, operations research
Citation
Yang, Z F 1994 'A simplicial algorithm for testing the integral properties of polytopes : A revision' CentER Discussion Paper, vol. 1994-89, CentER, Center for Economic Research.
License
info:eu-repo/semantics/restrictedAccess