This paper presents a new object-oriented framework for optimization based on evolutionary computation techniques to address NP-hard problems. At present, the NP-Opt is customized to deal with five classes of problems. The level of code reutilization is high and allows the adaptation to new problems very quickly, just by adding a few new classes to the framework. The structure of the classes an...

We prove that certain problems naturally arising in knot theory are NP–hard or NP–complete. These the of obtaining one diagram from another a link bounded number Reidemeister moves, determining whether has an unlinking splitting k <mml:annotation enc...

the travelling salesmen problem (tsp) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard because program statement is simple and leads this problem belonging to np...