Solution of Integer Linear Programming Problems by Direct Search

Authors:
Robert E. Echols;Leon Cooper
Affiliations:
Department of Applied Mathematics and Computer Science, Washington University, St. Louis, Missouri;Department of Applied Mathematics and Computer Science, Washington University, St. Louis, Missouri
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 2
Cited 1

`` Direct Search'' Solution of Numerical and Statistical Problems

Journal of the ACM (JACM)
Sequential Search: A Method for Solving Constrained Optimization Problems

Journal of the ACM (JACM)

A dynamic programming approach to dependent task clustering

ACM SIGMIS Database

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approximate but fairly rapid method for solving integer linear programming problems is presented, which utilizes, in part, some of the philosophy of “direct search” methods. The method is divided into phases which can be applied in order and has the desirable characteristic that a best feasible solution is always available. Numerical results are presented for a number of test problems. Some possible extensions and improvements are also presented.