A branch and bound algorithm for extreme point mathematical programming problems.
Suvrajeet SenHanif D. SheraliPublished in: Discret. Appl. Math. (1985)
Keyphrases
- mathematical programming
- branch and bound algorithm
- lower bounding
- combinatorial optimization
- mixed integer linear programming
- linear programming
- lower bound
- test problems
- branch and bound
- randomly generated problems
- upper bound
- optimal solution
- optimization approaches
- stationary points
- search tree
- robust optimization
- upper bounding
- branch and bound method
- simulated annealing
- np hard
- mixed integer linear
- max sat
- optimization problems
- precedence constraints
- feasible solution
- traveling salesman problem
- linear program
- metaheuristic
- dynamic programming
- search algorithm