The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2019.12.015 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126288572 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2019.12.015 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 17 December 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
0 references
0 references
0 references
