Efficiency considerations in the implementation of parallel branch-and- bound (Q1309863): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear speedup of an efficient sequential algorithm is not possible / 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: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound as a higher-order function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems / rank
 
Normal rank

Latest revision as of 12:05, 22 May 2024

scientific article
Language Label Description Also known as
English
Efficiency considerations in the implementation of parallel branch-and- bound
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references