Back to results
University of Illinois at Urbana-Champaign
Some Computational Aspects of the Branch and Bound Method for Integer Programs
Abstract
dc:descriptionDifferent 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.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Business Administration
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Samanta, Chanchal
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8209625
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/70438