Possibilistic bottleneck combinatorial optimization problems with ill-known weights.
Adam KasperskiPawel ZielinskiPublished in: Int. J. Approx. Reason. (2011)
Keyphrases
- combinatorial optimization problems
- optimization problems
- knapsack problem
- metaheuristic
- combinatorial optimization
- discrete optimization
- ant colony optimization
- traveling salesman problem
- shortest path problem
- vehicle routing problem
- job shop scheduling
- search space
- job shop scheduling problem
- linear combination
- exact algorithms
- evolutionary algorithm
- continuous optimization problems
- logic programming
- multi objective
- possibilistic logic
- neural network
- upper bound
- min cost