Probabilistic asymptotic properties of some combinatorial optimization problems.
Rainer E. BurkardUlrich FinckePublished in: Discret. Appl. Math. (1985)
Keyphrases
- combinatorial optimization problems
- asymptotic properties
- knapsack problem
- combinatorial optimization
- optimization problems
- metaheuristic
- discrete optimization
- ant colony optimization
- continuous optimization problems
- job shop scheduling
- shortest path problem
- fixed point
- traveling salesman problem
- probabilistic model
- bayesian networks
- job shop scheduling problem
- vehicle routing problem
- min cost
- exact algorithms
- minmax regret
- optimal solution
- memetic algorithm
- greedy algorithm
- graph cuts
- simulated annealing
- dynamic programming