In a recent paper, Yang proposes an integer la- beling algorithmfor determining whether an arbitrary simplex P in R~n contains aninteger point or not. The problem under consideration is a verydifficult one in the sense that it is NP- complete. The algorithm isbased on a specific integer labeling rule an a specific triangulationof R~n. In this paper we dis- cuss a practical implementation of thealgorithm and present a computer program (ILIN) for solving integerprogramming us- ing integer labeling algorithm. We also report on thesolution of a number of tested examples with up to 500 integervariables. Numerical results indicate that the algorithm iscomputationally Simple, flexible, efficient and stable.
展开▼
