Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
Adam KasperskiPawel ZielinskiPublished in: Oper. Res. Lett. (2013)
Keyphrases
- combinatorial optimization problems
- minmax regret
- optimization criterion
- knapsack problem
- optimization problems
- metaheuristic
- combinatorial optimization
- discrete optimization
- ant colony optimization
- shortest path problem
- traveling salesman problem
- job shop scheduling
- incomplete information
- total cost
- continuous optimization problems
- interval data
- decision making
- evolutionary algorithm
- min cost
- exact algorithms
- classifier fusion
- neural network
- owa operator
- multiple criteria
- aggregation operators
- possibility theory
- vehicle routing problem
- resource allocation
- cost function