Combinatorial optimization problems with uncertain costs and the OWA criterion
Adam KasperskiPawel ZielinskiPublished in: CoRR (2013)
Keyphrases
- combinatorial optimization problems
- minmax regret
- optimization criterion
- optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- discrete optimization
- ant colony optimization
- shortest path problem
- traveling salesman problem
- continuous optimization problems
- interval data
- incomplete information
- aggregation operators
- total cost
- job shop scheduling
- decision making
- exact algorithms
- min cost
- job shop scheduling problem
- classifier fusion
- genetic algorithm
- lower bound
- estimation of distribution algorithms
- utility function
- particle swarm optimization
- cost function