A stepped tabu search method for the clique partitioning problem

to related objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
ISSN
1573-7497
Extent
Online-Ressource
Language
Englisch
Notes
online resource.

Bibliographic citation
A stepped tabu search method for the clique partitioning problem ; day:3 ; month:12 ; year:2022 ; pages:1-18
Applied intelligence ; (3.12.2022), 1-18

Creator
Pacheco, Joaquín A.
Casado, Silvia
Contributor
SpringerLink (Online service)

DOI
10.1007/s10489-022-04304-7
URN
urn:nbn:de:101:1-2023021421413675205743
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 10:55 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

  • Pacheco, Joaquín A.
  • Casado, Silvia
  • SpringerLink (Online service)

Other Objects (12)

Concise integer linear programming formulation for clique partitioning problems

Concise integer linear programming formulation for clique partitioning problems

Unfolding polyhedra via tabu search

Unfolding polyhedra via tabu search

Cliquen

Kapitel

Cliquen

Implementation of a maximum clique search procedure on CUDA

Implementation of a maximum clique search procedure on CUDA

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Mehrkriterienoptimierung verteilter Echtzeitsysteme mit Tabu-Search

Hochschulschrift

Mehrkriterienoptimierung verteilter Echtzeitsysteme mit Tabu-Search

Die Clique

Buch

Die Clique

Maliks Clique

Jugendbücher ab 12 Jahre

Maliks Clique

Die Clique

Buch

Die Clique

Die Clique

Film

Die Clique

Parteien - Cliquen

Artikel

Parteien - Cliquen

Maliks Clique

Jugendbuch | Jugendbücher ab 12 Jahre

Maliks Clique

Related objects