On the complexity of project scheduling to minimize exposed time (Q2514874): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.02.013 / rank
Normal rank
 
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
Property / cites work
 
Property / cites work: Nash equilibria in competitive project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdicting a Nuclear-Weapons Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling modular projects on a bottleneck resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered knapsack and applications to scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Managing a Secret Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pegging approach to the precedence-constrained knapsack problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.02.013 / rank
 
Normal rank

Latest revision as of 03: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
    0 references
    0 references
    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

    Identifiers