A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem |
scientific article |
Statements
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (English)
0 references
10 November 2016
0 references
maximum distance-2 matching
0 references
optimization methods
0 references
grasp
0 references
branch and bound
0 references
parallel algorithms
0 references
wireless ad-hoc networks
0 references
capacity
0 references
