DocumentCode
1157813
Title
Hyperplane Search Algorithms for the Solution of Integer Programming Problems
Author
Cooper, Leon
Issue
3
fYear
1973
fDate
5/1/1973 12:00:00 AM
Firstpage
234
Lastpage
240
Abstract
An algorithm is presented for solving all-integer linear programming problems which successively searches hyperplanes parallel to the optimal hyperplane containing the solution to the associated linear programming problem with the integer restrictions suppressed. These hyperplanes are searched for integer solution points using a dynamic programming formulation. Numerical examples of this technique and some computational results are also presented.
Keywords
Computer science; Dynamic programming; Helium; Lattices; Linear programming; Operations research; Vectors;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/TSMC.1973.4309211
Filename
4309211
Link To Document