{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/70438"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/70438","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Some Computational Aspects of the Branch and Bound Method for Integer Programs","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Samanta, Chanchal"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Business Administration","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T23:30:13Z","date_published":"2014-12-15T23:30:13Z","updated_at":"2026-07-22T22:26:02Z","subjects":["Operations Research"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8209625"],"render_values":[{"text":"(UMI)AAI8209625","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/70438","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Samanta, Chanchal"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T23:30:13Z","10000-01-01","1982"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Business Administration"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Operations Research"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/70438","(UMI)AAI8209625"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:title","label":"Title","values":["Some Computational Aspects of the Branch and Bound Method for Integer Programs"]}]}],"canonical_facts":{"dc:creator":["Samanta, Chanchal"],"dc:date":["2014-12-15T23:30:13Z","10000-01-01","1982"],"dc:description":["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."],"dc:identifier":["http://hdl.handle.net/2142/70438","(UMI)AAI8209625"],"dc:subject":["Operations Research"],"dc:title":["Some Computational Aspects of the Branch and Bound Method for Integer Programs"],"dc:type":["text"],"thesis:degree_discipline":["Business Administration"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:02Z"}