Branching Methods in Combinatorial Optimization

  • J. P. Barthès
Part of the CISM International Centre for Mechanical Sciences book series (CISM, volume 175)


This chapter introduces a theoretical framework for methods solving combinatorial optimization problems by examining successively subsets of the set of solutions until one of the solutions located in one of the subsets is proved to be optimal, or unitl some user’s defined termination conditions are verified. This type of methods includes Branch and Bound and related procedures, Implicit Enumeration and Heuristic Search.


Feasible Solution Solution Class Search Tree Knapsack Problem Terminal Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Kolesar, Peter J., “A branch and Bound Algorithm for the Knapsack Problem”, Man. Sci., 13, 723 (1967).CrossRefGoogle Scholar
  2. [2]
    Greenberg, H., and Hegerich, R.L., “A branch Search Algorithm for the Knapsack Problem”, Man. Sci., 16, 327 (1970)MathSciNetMATHCrossRefGoogle Scholar
  3. [31.
    Granot, F., and P. Hammer, “On the Use of Boolean Functions in 0–1 Programming”, Opns. Res. Statistics and Economics, Pub. 70, Technion, Haifa, Israel (1970).Google Scholar
  4. [4]
    Balas, Egon, “An Additive Algorithm for Solving Linear Programs with 0–1 Variables”, Opns. Res., 13, 517 (1965).MathSciNetCrossRefGoogle Scholar

Copyright information

© CISM, Udine 1975

Authors and Affiliations

  • J. P. Barthès
    • 1
  1. 1.Dept. de Math. Appl. et d’Informat.Universitè de Technologie de CompiegneFrance

Personalised recommendations