Polynomial-time approximation for nonconvex optimization problems with an L1-constraint.
Yonatan MintzAnil AswaniPublished in: CDC (2017)
Keyphrases
- optimization problems
- polynomial time approximation
- evolutionary algorithm
- objective function
- np hard
- metaheuristic
- nonlinear programming
- cost function
- optimization methods
- approximation algorithms
- traveling salesman problem
- knapsack problem
- error bounds
- combinatorial optimization
- linear constraints
- subgradient method
- genetic algorithm
- worst case
- bin packing
- computational complexity