Files in this item
|(no description provided)|
|Title:||Some Computational Aspects of the Branch and Bound Method for Integer Programs|
|Department / Program:||Business Administration|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||Different heuristics for the branch and bound method are tested on capital budgeting type integer programming problems. The standard up and down penalties are compared with Tomlin's improved penalties. The use of the 'priority order' derived from the objective coefficients is also examined. A new heuristic--"the nearer integer rule"--is introduced that reduces the time taken to find the optimal solution.
The "pseudo-costs" of Benichou et. al. are examined and it is shown that there is no good basis for their use. The "BP Criterion" is compared to the "best-bound" rule for node selection and found to be inferior. A 'correction' for the depth of a node is suggested to improve the best-bound rule.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.
|Date Available in IDEALS:||2014-12-15|
This item appears in the following Collection(s)
Dissertations and Theses - Business Administration
Graduate Dissertations and Theses at Illinois
Graduate Theses and Dissertations at Illinois