An alternative approach for proving the NP-hardness of optimization problems.

T. C. E. Cheng Yakov M. Shafransky C. T. Ng

Published in: Eur. J. Oper. Res. (2016)

Keyphrases

np hardness
optimization problems
np hard
evolutionary algorithm
approximation algorithms
worst case analysis
cost function
metaheuristic
mixed integer
objective function
knapsack problem
combinatorial optimization
multi agent systems
multi dimensional