Asymptotically optimal approach for solving some hard discrete optimization problems.
Edward GimadiPublished in: Electron. Notes Discret. Math. (2006)
Keyphrases
- asymptotically optimal
- discrete optimization problems
- traveling salesman problem
- discrete optimization
- optimization problems
- asymptotic optimality
- decision problems
- branch and bound method
- optimal policy
- arrival rate
- swarm intelligence
- ant colony optimization
- combinatorial optimization
- branch and bound
- combinatorial optimization problems
- call center
- optimal solution
- np hard
- query processing
- objective function
- state space