Branching Methods in Combinatorial Optimization
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.
KeywordsFeasible Solution Solution Class Search Tree Knapsack Problem Terminal Node
Unable to display preview. Download preview PDF.
- [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