Some Computational Aspects of the Branch and Bound Method for Integer Programs
Samanta, Chanchal
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/70438
Description
Title
Some Computational Aspects of the Branch and Bound Method for Integer Programs
Author(s)
Samanta, Chanchal
Issue Date
1982
Department of Study
Business Administration
Discipline
Business Administration
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Operations Research
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
