Branch and bound based algorithms are used by many commercial mixed integer programming solvers for solving complex optimization problems. In a branch and bound based method, a feasible region is divided into smaller sub-problems. This is called branching and various branching strategies have been developed to improve the performance of branch and bound based algorithms. However, their performance has primarily been studied on general mixed integer programs. Thus, in the first phase of this thesis, we study the performance of these branching strategies on a specific, structured mixed integer program, the capacitated multi-commodity fixed charge network flow (MCFCNF) problem. We also develop new branching strategies using the pool of available feasible solutions for solving the mixed integer program for MCFCNF. We present the computational results for testing various branching rules with four different variants of the network design problem studied with SCIP and GLPK mathematical solvers.

Library of Congress Subject Headings

Branching processes; Branch and bound algorithms--Evaluation; Network analysis (Planning)--Data processing

Publication Date


Document Type


Department, Program, or Center

Industrial and Systems Engineering (KGCOE)


Hewitt, Michael


Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA274.76 .M87 2013


RIT – Main Campus

Plan Codes