Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems.
Monika WolfmayrPublished in: Comput. Math. Appl. (2020)
Keyphrases
- lower bound
- optimization problems
- objective function
- upper bound
- optimal cost
- evolutionary algorithm
- metaheuristic
- cost function
- optimal solution
- worst case
- higher order
- np hard
- branch and bound
- combinatorial optimization
- high cost
- multi objective
- branch and bound algorithm
- total cost
- lower and upper bounds
- upper and lower bounds
- min sum
- constant factor
- cost reduction
- lagrangian relaxation
- minimum cost
- optimization methods
- traveling salesman problem
- active learning