Search techniques for a nonlinear multiprocessor scheduling problem (Q3319771): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.3800290204 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009480555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art and theory of dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank

Latest revision as of 12:21, 14 June 2024

scientific article
Language Label Description Also known as
English
Search techniques for a nonlinear multiprocessor scheduling problem
scientific article

    Statements

    Search techniques for a nonlinear multiprocessor scheduling problem (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multiprocessor scheduling
    0 references
    distributed computer network
    0 references
    zero-one quadratic programming
    0 references
    directed acyclic search graph
    0 references
    backward shortest path labelling algorithm
    0 references
    branch-and-bound algorithm
    0 references
    0 references