Combinatorial optimization problems with balanced regret.
Marc GoerigkMichael HartischPublished in: Discret. Appl. Math. (2023)
Keyphrases
- combinatorial optimization problems
- optimization problems
- combinatorial optimization
- knapsack problem
- metaheuristic
- discrete optimization
- online learning
- ant colony optimization
- job shop scheduling
- lower bound
- traveling salesman problem
- loss function
- worst case
- shortest path problem
- job shop scheduling problem
- continuous optimization problems
- vehicle routing problem
- minimax regret
- expert advice
- tabu search
- constraint satisfaction
- simulated annealing
- cost function
- neural network
- constraint satisfaction problems
- decision makers
- information retrieval systems
- exact algorithms
- scheduling problem
- np hard
- search algorithm
- min cost
- information retrieval