A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems.
E. LevitinRainer TichatschkePublished in: J. Glob. Optim. (1998)
Keyphrases
- branch and bound
- combinatorial optimization
- semi infinite programming
- integer programming problems
- randomly generated problems
- branch and bound procedure
- branch and bound algorithm
- previously solved
- partial solutions
- branch and bound method
- lower bound
- upper bound
- optimal solution
- search algorithm
- convex optimization problems
- mathematical programming
- combinatorial optimization problems
- linear programming problems
- search space
- branch and bound search
- network design problem
- solving problems
- optimality conditions
- optimization problems
- search heuristics
- bnb adopt
- constraint satisfaction problems
- mixed integer programming
- tree search
- run times
- simulated annealing
- column generation
- convex optimization
- np complete