Branch and price

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In applied mathematics, branch and price is a method of combinatorial optimization for solving integer linear programming (ILP) and mixed integer linear programming (MILP) problems with many variables. The method is a hybrid of branch and bound and column generation methods.

Description of the algorithm[edit]

Branch and price is a branch and bound method in which at each node of the search tree, columns may be added to the linear programming relaxation (LP relaxation). At the start of the algorithm, sets of columns are excluded from the LP relaxation in order to reduce the computational and memory requirements and then columns are added back to the LP relaxation as needed. The approach is based on the observation that for large problems most columns will be nonbasic and have their corresponding variable equal to zero in any optimal solution. Thus, the large majority of the columns are irrelevant for solving the problem.

Outline of branch and price algorithm. Adapted from [1]

The algorithm typically begins by using a reformulation, such as Dantzig–Wolfe decomposition, to form what is known as the Master Problem. The decomposition is performed to obtain a problem formulation that gives better bounds when the relaxation is solved than when the relaxation of the original formulation is solved. But, the decomposition usually contains many variables and so a modified version, called the Restricted Master Problem, that only considers a subset of the columns is solved.[2] Then, to check for optimality, a subproblem called the pricing problem is solved to find columns that can enter the basis and reduce the objective function (for a minimization problem). This involves finding a column that has a negative reduced cost. Note that the pricing problem itself may be difficult to solve but since it is not necessary to find the column with the most negative reduced cost, heuristic and local search methods can be used.[3] The subproblem must only be solved to completion in order to prove that an optimal solution to the Restricted Master Problem is also an optimal solution to the Master Problem. Each time a column is found with negative reduced cost, it is added to the Restricted Master Problem and the relaxation is reoptimized. If no columns can enter the basis and the solution to the relaxation is not integer, then branching occurs.[1]

Most branch and price algorithms are problem specific since the problem must be formulated in such a way so that effective branching rules can be formulated and so that the pricing problem is relatively easy to solve.[4]

If cutting planes are used to tighten LP relaxations within a branch and price algorithm, the method is known as branch price and cut.[5]

Applications of branch and price[edit]

The branch and price method can be used to solve problems in a variety of application areas, including:

  • Graph multi-coloring.[3] This is a generalization of the graph coloring problem in which each node in a graph must be assigned a preset number of colors and any nodes that share an edge cannot have a color in common. The objective is then to find the minimum number of colors needed to have a valid coloring. The multi-coloring problem can be used to model a variety of applications including job scheduling and telecommunication channel assignment.
  • Vehicle routing problems.[2]
  • Generalized assignment problem.[6]

See also[edit]

External references[edit]


  1. ^ a b Akella, M.; S. Gupta; A. Sarkar. "Branch and Price: Column Generation for Solving Huge Integer Programs" (PDF). Archived from the original (PDF) on 2010-08-21. Retrieved 2012-12-19.
  2. ^ a b Feillet, Dominique (2010). "A tutorial on column generation and branch-and-price for vehicle routing problems". 4OR. 8 (4): 407–424. doi:10.1007/s10288-010-0130-z.
  3. ^ a b Mehrota, Anuj; M.A. Trick (2007). A Branch-and-price Approach for Graph Multi-Coloring. Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series. 37. pp. 15–29. CiteSeerX doi:10.1007/978-0-387-48793-9_2. ISBN 978-0-387-48790-8.
  4. ^ Lubbecke, M. "Generic Branch-Cut-and-Price" (PDF).
  5. ^ Desrosiers, J.; M.E. Lubbecke (2010). "Branch-Price-and-Cut Algorithms". Wiley Encyclopedia of Operations Research and Management Science.
  6. ^ Savelsbergh, M. (1997). "A branch-and-price algorithm for the generalized assignment problem". Operations Research. 831-841. 45 (6): 831–841. doi:10.1287/opre.45.6.831.