Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems.
Derek E. ArmstrongSheldon H. JacobsonPublished in: J. Glob. Optim. (2003)
Keyphrases
- np hard
- discrete optimization problems
- decision problems
- np hardness
- worst case
- computational complexity
- optimal solution
- traveling salesman problem
- scheduling problem
- approximation algorithms
- lower bound
- linear programming
- mathematical model
- model checking
- special case
- genetic algorithm
- optimization problems
- optimization algorithm
- discrete optimization