Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4816824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulation tool for the performance evaluation of parallel branch and bound algorithms / rank
 
Normal rank

Latest revision as of 13:52, 27 August 2024

scientific article; zbMATH DE number 7811601
Language Label Description Also known as
English
Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
scientific article; zbMATH DE number 7811601

    Statements

    Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (English)
    0 references
    0 references
    0 references
    1 March 2024
    0 references
    algorithms for parallel computations
    0 references
    discrete optimization
    0 references
    branch-and-bound method
    0 references
    speedup estimate
    0 references
    model of computation process
    0 references

    Identifiers