A Branch and Bound Method for Solving Integer Separable Concave Problems.
Oscar BarrientosRafael CorreaP. ReyesA. ValdebenitoPublished in: Comput. Optim. Appl. (2003)
Keyphrases
- branch and bound method
- solving problems
- objective function
- np complete
- discrete optimization problems
- reduce the search space
- mixed integer programming
- feasible solution
- lower bound
- combinatorial optimization
- branch and bound algorithm
- multistage
- branch and bound
- mathematical programming
- evolutionary algorithm
- solving complex
- optimal solution
- neural network