A Branch-and-Bound Decomposition Approach for Solving Quasiconvex-Concave Programs
Reiner HorstLe Dung MuuM. NastPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Keyphrases
- branch and bound
- combinatorial optimization
- quasiconvex
- integer programming problems
- objective function
- tree decomposition
- lower bound
- branch and bound algorithm
- search algorithm
- branch and bound search
- lagrangian dual
- optimal solution
- convex functions
- column generation
- search space
- upper bound
- geometric reconstruction
- partial solutions
- bnb adopt
- multicriteria optimization
- branch and bound procedure
- beam search
- randomly generated problems
- branch and bound method
- previously solved
- network design problem
- simulated annealing
- tree search
- tree search algorithm
- finite number
- metaheuristic
- implicit enumeration
- lagrangian heuristic
- decision making
- convex sets
- utility function
- integer program
- decomposition method
- max sat
- linear programming
- genetic algorithm