On the complexity of project scheduling to minimize exposed time (Q2514874): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2014.02.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2014.02.013 / rank | |||
Normal rank | |||
Latest revision as of 04:52, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of project scheduling to minimize exposed time |
scientific article |
Statements
On the complexity of project scheduling to minimize exposed time (English)
0 references
4 February 2015
0 references
complexity theory
0 references
project scheduling
0 references
secret project
0 references
NP-complete
0 references
polynomial algorithm
0 references
