Universidad de Burgos RIUBU Principal Default Universidad de Burgos RIUBU Principal Default
  • español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
Universidad de Burgos RIUBU Principal Default
  • Ayuda
  • Contattaci
  • Manda Feedback
  • Acceso abierto
    • Archivar en RIUBU
    • Acuerdos editoriales para la publicación en acceso abierto
    • Controla tus derechos, facilita el acceso abierto
    • Sobre el acceso abierto y la UBU
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Ricerca

    Tutto RIUBUArchivi & CollezioniData di pubblicazioneAutoriTitoliSoggettiQuesta CollezioneData di pubblicazioneAutoriTitoliSoggetti

    My Account

    LoginRegistrazione

    Statistiche

    Ver Estadísticas de uso

    Compartir

    Mostra Item 
    •   RIUBU Home
    • E-Prints
    • Untitled
    • Untitled
    • Untitled
    • Mostra Item
    •   RIUBU Home
    • E-Prints
    • Untitled
    • Untitled
    • Untitled
    • Mostra Item

    Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10259/7402

    Título
    A stepped tabu search method for the clique partitioning problem
    Autor
    Pacheco Bonrostro, JoaquínAutoridad UBU Orcid
    Casado Yusta, SilviaAutoridad UBU Orcid
    Publicado en
    Applied Intelligence. 2022
    Editorial
    Springer Nature
    Fecha de publicación
    2022-12
    ISSN
    0924-669X
    DOI
    10.1007/s10489-022-04304-7
    Abstract
    Given an undirected graph, a clique is a subset of vertices in which the induced subgraph is complete; that is, all pairs of vertices of this subset are adjacent. Clique problems in graphs are very important due to their numerous applications. One of these problems is the clique partitioning problem (CPP), which consists of dividing the set of vertices of a graph into the smallest number of cliques possible. The CPP is an NP-hard problem with many application fields (timetabling, manufacturing, scheduling, telecommunications, etc.). Despite its great applicability, few recent studies have focused on proposing specific resolution methods for the CPP. This article presents a resolution method that combines multistart strategies with tabu search. The most novel characteristic of our method is that it allows unfeasible solutions to be visited, which facilitates exploration of the solution space. The computational tests show that our method performs better than previous methods proposed for this problem. In fact, our method strictly improves the results of these methods in most of the instances considered while requiring less computation time.
    Palabras clave
    Clique partitioning problem
    Metaheuristics
    Tabu search
    Multistart methods
    Materia
    Economía
    Economics
    URI
    http://hdl.handle.net/10259/7402
    Versión del editor
    https://doi.org/10.1007/s10489-022-04304-7
    Aparece en las colecciones
    • Untitled
    Atribución 4.0 Internacional
    Documento(s) sujeto(s) a una licencia Creative Commons Atribución 4.0 Internacional
    Files in questo item
    Nombre:
    Pacheco-ain_2022.pdf
    Tamaño:
    1.798Mb
    Formato:
    Adobe PDF
    Thumbnail
    Mostra/Apri

    Métricas

    Citas

    Academic Search
    Ver estadísticas de uso

    Exportar

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis
    Mostra tutti i dati dell'item