Pages that link to "Item:Q336528"
From MaRDI portal
The following pages link to A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528):
Displaying 3 items.
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
