The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.12.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3001605797 / rank | |||
Normal rank | |||
Revision as of 00:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The clique problem with multiple-choice constraints under a cycle-free dependency graph |
scientific article |
Statements
The clique problem with multiple-choice constraints under a cycle-free dependency graph (English)
0 references
29 June 2020
0 references
clique problem
0 references
multiple-choice constraints
0 references
perfect graph
0 references
convex-hull description
0 references
scheduling
0 references
