Exploració per tema "Metaheurístics"

Ara es mostren els items 1-4 de 4

    • Algorithms for the weighted independent domination problem 

      Rodríguez Corominas, Guillem (Universitat Politècnica de Catalunya, 2019-07-04)
      Treball Final de Grau
      Accés obert
      El problema de la dominació independent ponderada és un problema NP-hard d'optimització combinatòria en grafs. Aquest problema només ha estat abordat a la literatura per enfocaments de programació lineal entera, heurístiques ...

    • Solving the Response Time Variability Problem by means of a psychoclonal approach 

      García Villoria, Alberto; Pastor Moreno, Rafael (2008-03)
      Report de recerca
      Accés obert
      The Response Time Variability Problem (RTVP) is a combinatorial scheduling problem which has recently appeared in the literature. This problem has a wide range of reallife applications in, for example, manufacturing, hard ...

    • Solving the Response Time Variability Problem by means of metaheuristics 

      García Villoria, Alberto; Pastor Moreno, Rafael; Corominas Subias, Albert (IOS Press, 2006-10)
      Article
      Accés obert
      The Response Time Variability Problem (RTVP) is a combinatorial NPhard problem which has a wide range of real-life applications. It has recently appeared in the literature and has therefore not been widely discussed to ...

    • Solving the Response Time Variability Problem by means of the electromagnetism-like mechanism 

      García Villoria, Alberto; Pastor Moreno, Rafael (2008-03)
      Report de recerca
      Accés obert
      The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem that has recently appeared in the literature. The RTVP has a wide range of real-life applications such as in the automobile industry, ...