Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonlinear Programming Problems.
Florbela P. FernandesM. Fernanda P. CostaEdite M. G. P. FernandesPublished in: ICCSA (2) (2014)
Keyphrases
- branch and bound
- search space
- optimal solution
- search algorithm
- mixed integer
- objective function
- network design problem
- lagrangian heuristic
- cost function
- dynamic programming
- branch and bound algorithm
- computational complexity
- np hard
- convex hull
- lower bound
- learning algorithm
- worst case
- linear programming
- combinatorial optimization
- probabilistic model
- upper bound
- high dimensional
- knapsack problem
- nonlinear programming problems