The problem when it comes to choosing the best element (by means of some judgement) from a set of available elements, is one of the most common problems and it belongs to a field of the mathematical optimisation. From Int-Code, we provide the customer of comprehensive response to this kind of problems; designing, developing and coding an algorithm which use will be of providing a solution efficiently to the suggested problem. We work in different mathematical optimisation areas, solving problems by means of the following techniques: - Determinist optimisation (Gradient descent, Newton and Quasi-Newton methods, Conjugate gradient methods and Penalty and Barrier Methods for constrained optimisation) - Heuristics (Greedy strategies and local search algorithms like Hill-Climbing) - Metaheuristics (Variable Neighbourhood Search, Simulated Annealing, Ant Colony, Tabu Search and Genetic Algorithms)