An active set algorithm for robust combinatorial optimization based on separation oracles.
Christoph BuchheimMarianna De SantisPublished in: Math. Program. Comput. (2019)
Keyphrases
- combinatorial optimization
- active set
- simulated annealing
- efficient implementation
- computational complexity
- combinatorial optimization problems
- neural network
- optimal solution
- benchmark problems
- branch and bound
- traveling salesman problem
- objective function
- dynamic programming
- cost function
- image classification
- metaheuristic
- ant colony optimization
- optimization problems
- worst case
- convergence rate
- knapsack problem
- np hard
- computationally intensive
- search space
- nonnegative matrix factorization
- lower bound