Thumbnail
Access Restriction
Subscribed

Author Echols, Robert E. ♦ Cooper, Leon
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1968
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1968-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 15
Issue Number 1
Page Count 10
Starting Page 75
Ending Page 84


Open content in new tab

   Open content in new tab
Source: ACM Digital Library