scholarly journals FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems

2018 ◽  
pp. 19-35
Author(s):  
D. V. Gribanov
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Lattice Vector ◽  
Fpt Algorithms ◽  
Linear Programming Problems

Reduction-by-Projection Method for Linear Programming Problems

2014 ◽  
Vol 672-674 ◽  
pp. 1968-1971
Author(s):  
Xue Tong ◽  
Jun Qiang Wei
Keyword(s):  
Linear Programming ◽  
Linear Systems ◽  
Integer Linear Programming ◽  
Projection Method ◽  
Simplex Method ◽  
New Method ◽  
Linear Programming Problems

This paper defines the projection of algebic systems, and studies the projecting algorithm for linear systems. As its application, a new method is given to solve linear programming problems, which is called reduction-by-projection method. For many problems, especially when the problems have many constraint conditions in comparison with the number of their variables, the method needs less computation than simplex method and others. The great advantage of the method is shown when solving the integer linear programming problems.

Solution of Integer Linear Programming Problems by Direct Search

1968 ◽  
Vol 15 (1) ◽  
pp. 75-84 ◽  
Author(s):  
Robert E. Echols ◽  
Leon Cooper
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Direct Search ◽  
Linear Programming Problems
Sign in / Sign up

Export Citation Format

Share Document