The aim of this dissertation is to present an algorithm for mixed integer programs which when started with a good heuristic solution can find improved solutions and reduce the error estimate as quickly as possible. This is achieved by using two ideas: a fixed order branch-and-bound method with selective expansion of subproblems and the sieve strategy which uses stronger than optimal bounds. The fixed order branch-and-bound method with selective expansion of subproblems is effective in reducing the error estimate quickly whereas the sieve strategy is effective in reducing the error estimate as well as finding improved solutions quickly. Computational experience is reported.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/183948 |
| Date | January 1982 |
| Creators | SINGHAL, JAYA ASTHANA. |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | English |
| Detected Language | English |
| Type | text, Dissertation-Reproduction (electronic) |
| Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.0021 seconds