A Branch and Bound Approach for Solving a Class of Generalized Semi-Infinite Programming Problems
E. LevitinRainer TichatschkePublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Keyphrases
- branch and bound
- combinatorial optimization
- integer programming problems
- semi infinite programming
- lower bound
- partial solutions
- branch and bound algorithm
- randomly generated problems
- branch and bound procedure
- branch and bound method
- column generation
- previously solved
- linear programming problems
- upper bound
- search algorithm
- optimal solution
- convex optimization problems
- linear programming
- optimization problems
- solving problems
- search space
- branch and bound search
- optimality conditions
- network design problem
- nonlinear programming
- combinatorial optimization problems
- mathematical programming
- lagrangian dual
- exact solution
- bnb adopt
- tree search
- genetic algorithm
- linear program
- np complete
- high level