Complexity and heuristics for the weighted max cut-clique problem
Mathias Bourel, Eduardo Canale, Franco Robledo, Pablo Romero and Luis Stábile
| Year of publication: |
2022
|
|---|---|
| Authors: | Bourel, Mathias ; Canale, Eduardo ; Robledo, Franco ; Romero, Pablo ; Stábile, Luis |
| Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 2, p. 908-928
|
| Subject: | combinatorial optimization problem | GRASP | ILP | max cut-clique | tabu search | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1111/itor.12807 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012795816