Abstract
In this chapter we consider the following problem. Given an arbitrary simplex P, for example, the convex hull of m + 1 (0 ≤ m ≤ n) affinely independent vectors of ℝn, the problem is that of determining whether or not P contains an integer point. This problem is not quite as innocent as it appears. In fact we first prove that it is intractable in the sense that it is NP-complete. We then develop an algorithm to solve the problem. The algorithm is based on both a specific integer labeling rule and the K l-triangulation of ℝn. The main feature of the algorithm can be described as follows. We first subdivide ℝn into n-dimensional simplices such that all integer points of ℝn are the vertices of the triangulation, and then assigns an integer to each integer point of ℝn according to the labeling rule. Starting from an arbitrarily chosen integer point, the algorithm generates a sequence of adjacent simplices of varying dimension and terminates with either the YES or (exclusively) NO answer within a finite number of steps. In the YES case, the algorithm finds an integer point in P. The NO answer shows that there is no integer point in P. The algorithm is derived from the algorithm of van der Laan and Talman [1979] (see Chapter 5) although their algorithm was introduced to compute a fixed point of a continuous function.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yang, Z. (1999). An Integer Labeling Algorithm for Solving a Class of Integer Programming Problems. In: Computing Equilibria and Fixed Points. Theory and Decision Library, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4839-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4839-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5070-3
Online ISBN: 978-1-4757-4839-0
eBook Packages: Springer Book Archive