EFFICIENT HEURISTIC PROCEDURES FOR INTEGER LINEAR PROGRAMMING WITH AN INTERIOR.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
The report presents and evaluates some new heuristic procedures for seeking an approximate solution of pure integer linear programming problems having only inequality constraints. The computation time required by these methods after obtaining the optimal noninteger solution by the simplex method has generally been only a small fraction of that used by the simplex method for the problems tested which have 15 to 300 original variables. Furthermore, the solution obtained by the better procedures consistently has been close to optimal and frequently has actually been optimal. There are numerous important problems in logistics that can be formulated as integer linear programming problems. These algorithms enable one to obtain good solutions to large problems of this kind. Author
- Operations Research