• Solving DC programs using the cutting angle method 

      Ferrer Biosca, Alberto; Bagirov, Adil; Beliakov, Gleb (2014-02)
      Article
      Accés obert
      In this paper, we propose a new algorithm for global minimization of functions represented as a difference of two convex functions. The proposed method is a derivative free method and it is designed by adapting the extended ...
    • The non-smooth and bi-objective team orienteering problem with soft constraints 

      Estrada Moreno, Alejandro; Ferrer Biosca, Alberto; Juan, Ángel A.; Panadero, Javier; Bagirov, Adil (Multidisciplinary Digital Publishing Institute (MDPI), 2020)
      Article
      Accés obert
      In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting ...