Lagrangian bounds in multiextremal polynomial and discrete optimization problems.
Naum Z. ShorPetro I. StetsyukPublished in: J. Glob. Optim. (2002)
Keyphrases
- discrete optimization problems
- traveling salesman problem
- optimization problems
- discrete optimization
- branch and bound method
- lower bound
- upper bound
- decision problems
- lower and upper bounds
- lagrangian relaxation
- swarm intelligence
- worst case
- duality gap
- special case
- optimal solution
- evolutionary algorithm
- branch and bound algorithm
- engineering problems
- combinatorial optimization
- vehicle routing problem
- branch and bound
- learning algorithm
- pattern recognition
- objective function
- artificial intelligence