An algorithm of internal feasible directions for linear integer programming

Abstract An approximate algorithm for solving pure integer problems is examined. The algorithm belongs to the class of component algorithms using feasible integer directions. The basic characteristics of the algorithm are analyzed. Testing on an IBM/PC/AT personal computer is carried out. The proposed algorithm is compared with other well known approximate algorithms.

[1]  Vassil Sgurev,et al.  TRASY -- An automated system for real-time control of the industrial truck haulage in open-pit mines , 1989 .

[2]  Frederick S. Hillier,et al.  Interior Path Methods for Heuristic Integer Programming Procedures , 1979, Oper. Res..

[3]  Gary D. Scudder,et al.  A simple strategy for solving a class of 0-1 integer programming models , 1986, Comput. Oper. Res..

[4]  H T Lau.  Combinatorial Heuristic Algorithms With Fortran , 1986 .

[5]  Robert E. Echols,et al.  Solution of Integer Linear Programming Problems by Direct Search , 1968, JACM.

[6]  Bruce A. McCarl,et al.  A HEURISTIC FOR GENERAL INTEGER PROGRAMMING , 1974 .

[7]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[8]  E. L. Lawler,et al.  A Method for Solving Discrete Optimization Problems , 1966, Oper. Res..

[9]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[10]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[11]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[12]  G. Nemhauser,et al.  Integer Programming , 2020 .

[13]  Hisashi Mine,et al.  A heuristic algorithm for mixed-integer programming problems , 1974 .

[14]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[15]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[16]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..