A standard branch-and-bound approach for nonlinear semi-infinite problems.
Antoine MarendetAlexandre GoldsztejnGilles ChabertChristophe JermannPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- branch and bound
- semi infinite
- randomly generated problems
- branch and bound procedure
- branch and bound algorithm
- combinatorial optimization
- lower bound
- column generation
- search algorithm
- linear program
- branch and bound method
- optimization problems
- upper bound
- optimal solution
- quadratic program
- search space
- semidefinite
- network design problem
- dynamic programming
- simulated annealing
- exact solution
- optimality conditions