The clique problem with multiple-choice constraints under a cycle-free dependency graph

The clique problem with multiple-choice constraints (CPMC) represents a very common substructure in many real-world applications, for example scheduling problems with precedence constraints. It consists in finding a clique in a graph whose nodes are partitioned into subsets, such that exactly one no...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2020-09, Vol.283, p.59-77
Hauptverfasser:	Bärmann, Andreas, Gemander, Patrick, Merkert, Maximilian
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Clique problem Computational geometry Convex-hull description Convexity Job shops Multiple-choice constraints Perfect graph Polynomials Precedence constraints Scheduling Substructures Underground railways
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!