An algorithm of internal feasible directions for linear integer programming

An algorithm of internal feasible directions for linear integer programming

0.00 Avg rating0 Votes
Article ID: iaor1993721
Country: Netherlands
Volume: 52
Issue: 2
Start Page Number: 203
End Page Number: 214
Publication Date: May 1991
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
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.

Reviews

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