Access Restriction

Author Phuong, Ta Huu
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This paper presents a branch and bound method for solving problems in which the objective function is quadratic, the constraints are linear, and some or all variables are required to be integer. The algorithm is obtained by grafting an inverse-basis version of Beale's method onto the Land-Doig procedure. The code has been tested on a computer, and computational results with various strategies of branching are reported.
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 1976-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 3
Page Count 7
Starting Page 468
Ending Page 474

Open content in new tab

   Open content in new tab
Source: ACM Digital Library