ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming

Qiang LI; Fred JANSSEN; Zaifu YANG; Tetsuo IDA

ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming

Qiang LI, Fred JANSSEN, Zaifu YANG, Tetsuo IDA

Full Text Views

0

Cite this

Summary :

In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in Rⁿ 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ⁿ. 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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.2 pp.304-309

Publication Date: 1998/02/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Numerical Analysis and Optimization

Cite this

Copy

Qiang LI, Fred JANSSEN, Zaifu YANG, Tetsuo IDA, "ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 2, pp. 304-309, February 1998, doi: .
Abstract: In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in Rⁿ 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ⁿ. 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_2_304/_p

Copy

@ARTICLE{e81-a_2_304,
author={Qiang LI, Fred JANSSEN, Zaifu YANG, Tetsuo IDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming},
year={1998},
volume={E81-A},
number={2},
pages={304-309},
abstract={In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in Rⁿ 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ⁿ. 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.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 304
EP - 309
AU - Qiang LI
AU - Fred JANSSEN
AU - Zaifu YANG
AU - Tetsuo IDA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1998
AB - In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in Rⁿ 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ⁿ. 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.
ER -