Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
Adam KasperskiPawel ZielinskiPublished in: CoRR (2013)
Keyphrases
- combinatorial optimization problems
- minmax regret
- optimization criterion
- knapsack problem
- optimization problems
- metaheuristic
- discrete optimization
- combinatorial optimization
- ant colony optimization
- shortest path problem
- interval data
- continuous optimization problems
- traveling salesman problem
- job shop scheduling
- decision making
- optimal solution
- min cost
- tabu search
- incomplete information
- evolutionary algorithm
- dynamic programming
- job shop scheduling problem
- search algorithm
- reinforcement learning
- neural network
- resource allocation
- cost function