ILIN: An implementation of the integer labeling algorithm for integer programming

ILIN: An implementation of the integer labeling algorithm for integer programming

0.00 Avg rating0 Votes
Article ID: iaor1999917
Country: Japan
Volume: E81-A
Issue: 2
Start Page Number: 304
End Page Number: 309
Publication Date: Feb 1998
Journal: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Authors: , , ,
Keywords: optimization
Abstract:

In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in Rn contains an integer point or not. The problem under consideration is a very difficult one in the sense that it is NP-complete. The algorithm is based on a specific integer labeling rule and a specific triangulation of Rn. In this paper we discuss a practical implementation of the algorithm and present a computer program for solving integer programming using integer labeling algorithm. We also report on the solution of a number of tested examples with up to 500 integer variables. Numerical results indicate that the algorithm is computationally simple, flexible, efficient and stable.

Reviews

Required fields are marked *. Your email address will not be published.