A RELAXATION ALGORITHM FOR SOLVING MIXED INTEGER PROGRAMMING PROBLEMS
NGUYEN VU TIEN, LE DUNG MUU
We propose an algorithm for solving mixed integer linear programming problem, which is a combination of branch-and-bound and
decomposition procedure. For branching and bounding we divide a rectangular domain into smaller and smaller subrectangles, and to each generated subrectangle