On the complexity of project scheduling to minimize exposed time (Q2514874): 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.ejor.2014.02.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037934049 / rank | |||
Normal rank | |||
Revision as of 01:30, 20 March 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
