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

作     者：Li, Q Janssen, F Yang, ZF Ida, T 

作者机构：Univ Tsukuba Inst Informat Sci & Elect Tsukuba Ibaraki 3058573 Japan Tilburg Univ Dept Econ NL-5000 LE Tilburg Netherlands Univ Tsukuba Inst Socioecon Planning Tsukuba Ibaraki 3058573 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：1998年第E81A卷第2期

页      面：304-309页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：simplex integer point integer labeling algorithm integer linear programming 

摘      要：In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in R-n 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 R-n. In this paper we discuss a practical implementation of the algorithm and present a computer program (ILIN) 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.