Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion.
Adam KasperskiPawel ZielinskiPublished in: OR (2012)
Keyphrases
- combinatorial optimization problems
- minmax regret
- optimization criterion
- knapsack problem
- optimization problems
- discrete optimization
- combinatorial optimization
- metaheuristic
- ant colony optimization
- job shop scheduling
- incomplete information
- shortest path problem
- vehicle routing problem
- continuous optimization problems
- aggregation operators
- job shop scheduling problem
- total cost
- traveling salesman problem
- classifier fusion
- evolutionary algorithm
- min cost
- neural network
- benchmark problems
- exact algorithms
- estimation of distribution algorithms
- tabu search
- dynamic programming
- decision making
- machine learning