Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints.
Peter L. JacksonRobin O. RoundyPublished in: Math. Oper. Res. (1991)
Keyphrases
- upper bound
- lower bound
- optimization criteria
- lower and upper bounds
- inequality constraints
- quasiconvex
- constraint satisfaction
- convex functions
- decision trees
- linear functions
- branch and bound algorithm
- tree automata
- branch and bound
- penalty functions
- error probability
- feasible set
- continuous variables
- constrained minimization
- dual variables
- phylogenetic trees
- global constraints
- constrained optimization
- convex optimization
- convex hull
- evolutionary algorithm
- search algorithm
- objective function