FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.

Persistent Link:
http://hdl.handle.net/10150/183948
Title:
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
Author:
SINGHAL, JAYA ASTHANA.
Issue Date:
1982
Publisher:
The University of Arizona.
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.
Abstract:
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.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Integer programming.; Algorithms.; Programming (Mathematics); Branch and bound algorithms.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Management Information Systems; Graduate College
Degree Grantor:
University of Arizona

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleFIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.en_US
dc.creatorSINGHAL, JAYA ASTHANA.en_US
dc.contributor.authorSINGHAL, JAYA ASTHANA.en_US
dc.date.issued1982en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © 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.en_US
dc.description.abstractThe 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.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectInteger programming.en_US
dc.subjectAlgorithms.en_US
dc.subjectProgramming (Mathematics)en_US
dc.subjectBranch and bound algorithms.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineManagement Information Systemsen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.identifier.proquest8217504en_US
dc.identifier.oclc682590094en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.