Optimization Online


Visualizing Branch-and-Bound Algorithms

O.Y. Ozaltın(oyo1***at***pitt.edu)
B. Hunsaker(hunsaker***at***engr.pitt.edu)
T.K. Ralphs(tkralphs***at***lehigh.edu)

Abstract: We present a suite of tools for visualizing the status and progress of branch-and-bound algorithms for mixed integer programming. By integrating these tools with the open-source codes CBC, SYMPHONY, and GLPK, we demonstrate the potential usefulness of visual representations in helping a user predict future progress of the algorithm or analyzing the algorithmís performance. We have also implemented a flexible toolkit, called the Branch and Cut Analysis Kit, that can be used in conjunction with any instrumented solver to create visual representations in the form of image files. The kit will be made available under an open-source license.

Keywords: integer programming; branch-and-bound;

Category 1: Integer Programming


Download: [PDF]

Entry Submitted: 09/25/2007
Entry Accepted: 09/25/2007
Entry Last Modified: 09/25/2007

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society