Min-max and two-stage possibilistic combinatorial optimization problems.
Adam KasperskiPawel ZielinskiPublished in: FUZZ-IEEE (2011)
Keyphrases
- combinatorial optimization problems
- min max
- combinatorial optimization
- optimization problems
- discrete optimization
- knapsack problem
- metaheuristic
- ant colony optimization
- max min
- multiobjective optimization
- traveling salesman problem
- possibilistic logic
- job shop scheduling
- shortest path problem
- logic programming
- possibility theory
- continuous optimization problems
- exact algorithms
- min cost
- optimal solution
- minmax regret
- job shop scheduling problem
- branch and bound algorithm
- aco algorithms
- dynamic programming