Combinatorial Optimization Problems with Balanced Regret.
Marc GoerigkMichael HartischPublished in: CoRR (2021)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- combinatorial optimization
- optimization problems
- metaheuristic
- discrete optimization
- ant colony optimization
- online learning
- shortest path problem
- lower bound
- expert advice
- traveling salesman problem
- job shop scheduling
- loss function
- continuous optimization problems
- min cost
- regret minimization
- job shop scheduling problem
- np hard
- neural network
- multi armed bandit problems
- regret bounds
- minmax regret
- estimation of distribution algorithms
- vehicle routing problem
- benchmark problems
- utility function
- tabu search
- worst case
- evolutionary algorithm
- objective function
- genetic algorithm