A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Solving Integer and Mixed Integer Linear Problems with ABS Method
2013
Acta Polytechnica Hungarica
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory's cuts) to narrow down the solution to the optimal integer solution. The ABS class of algorithms is a generalized class of algorithms which, with appropriate selection of parameters, is
doi:10.12700/aph.10.07.2013.7.7
fatcat:wpkhkcjpifgalmb7hebfomh6mm