Complexity Reduction for Solving a Pure Integer Program by the Branch and Bound Method Using Gomory Constraints
Download
Download
Download
Full text for this resource is not available from the Research Repository.
Export
Kumar, Santosh, Munapo, Elias, Jones, Brian C and Mehlawat, Mukesh (2008) Complexity Reduction for Solving a Pure Integer Program by the Branch and Bound Method Using Gomory Constraints. ASOR Bulletin, 27 (2). pp. 13-22. ISSN 0812-860X
Abstract
This paper deals with improving complexity of the branch and bound method for solving a pure integer program. This improvement is achieved by formulating a characteristic pure integer program from all the Gomory constraints arising from the relaxed LP solution of the given problem. The number of sub-problems required in the branch and bound method reduce significantly.
| Item type | Article |
| URI | https://vuir.vu.edu.au/id/eprint/3773 |
| Official URL | http://www.asor.org.au/publication/files/jun2008/A... |
| Subjects | Historical > Faculty/School/Research Centre/Department > School of Engineering and Science Historical > FOR Classification > 0199 Other Mathematical Sciences Information Systems Historical > SEO Classification > 9609 Land and Water Management |
| Keywords | ResPubID15131, branch and bound method, pure integer programs, characteristic equation, characteristic pure integer program, Gomory constraints, descending hyper-plane method |
| Download/View statistics | View download statistics for this item |
CORE (COnnecting REpositories)