2026-09-22T08:51:03Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/70438 2023-07-11 col_2142_5131 col_2142_14791 com_2142_5130 com_2142_14790 com_2142_9216

Samanta, Chanchal 2014-12-15T23:30:13Z 2014-12-15T23:30:13Z 10000-01-01 1982 1982 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. Made available in DSpace on 2014-12-15T23:30:13Z (GMT). No. of bitstreams: 1 8209625.pdf: 1665648 bytes, checksum: 25a5c210c19aebfa1660b8e21b495016 (MD5) Previous issue date: 1982 Embargo set by: Seth Robbins for item 70604 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 66 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982. http://hdl.handle.net/2142/70438 (UMI)AAI8209625 Operations Research Some Computational Aspects of the Branch and Bound Method for Integer Programs text Business Administration Business Administration University of Illinois at Urbana-Champaign Dissertation Ph.D.