Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / 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: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch and bound algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problème de la bipartition minimale d'un graphe / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02073939 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049205750 / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
scientific article

    Statements

    Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    continuous and discrete optimization
    0 references
    branch-and-bound algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references