A branch and bound algorithm for solving separable convex integer programming problems.
Won J. LeeA. Victor CabotMunirpallam A. VenkataramananPublished in: Comput. Oper. Res. (1994)
Keyphrases
- integer programming problems
- branch and bound algorithm
- branch and bound
- lower bound
- combinatorial optimization
- search algorithm
- optimal solution
- cutting plane
- upper bound
- column generation
- artificial bee colony algorithm
- test problems
- linear programming
- search space
- search tree
- upper bounding
- tree search
- finding an optimal solution
- variable ordering
- lagrangian relaxation
- convex optimization
- convex hull
- integer variables
- np hard
- particle swarm optimization algorithm
- neural network
- max sat
- hybrid algorithm