Elsevier

Operations Research Letters

Volume 1, Issue 5, November 1982, Pages 182-185
Operations Research Letters

A simple, all primal branch and bound approach to pure and mixed integer binary programs

https://doi.org/10.1016/0167-6377(82)90036-0Get rights and content

Abstract

Many branch and bound procedures for integer programming employ linear programming to obtain bound information. Nodes in the tree structure are defined by explicitly changing bounds on certain variables and/or adding one or more constraints to the parent LP; thus, primal feasibility is destroyed. The design and analysis of the resulting tree structure requires that basis information be stored for each node and that feasibility restoring pivots be used to obtain the node bound. In turn, this may require the introduction of artificial variables and/or dual simplex pivots.

This paper describes a simple procedure for branch and bound that does not destroy primal feasibility. Moreover, the information required to be stored to define the node problems is minimal.

References (2)

  • G. Mitra

    Investigation of some branch and bound strategies for the solution of mixed integer linear programs

    Math. Programming

    (1973)
  • R.S. Garfinkel et al.

    Integer Programming

    (1972)

Cited by (0)

View full text