Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 12:50, 15 May 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
27 June 1992
0 references
continuous and discrete optimization
0 references
branch-and-bound algorithms
0 references
0 references
