A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem

DOI10.1016/j.cor.2013.04.009zbMath1348.90592OpenAlexW2025718141MaRDI QIDQ336528

Ioannis T. Christou, Spyridon Vassilaras

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.009

zbMATH Keywords

capacitybranch and boundparallel algorithmsoptimization methodsgraspmaximum distance-2 matchingwireless ad-hoc networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem ⋮ Moderately exponential time algorithms for the maximum induced matching problem

Uses Software

• SCIP
• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-\(k\) knowledge in self-stabilizing algorithms
• A probabilistic heuristic for a computationally difficult set covering problem
• NP-completeness of some generalizations of the maximum matching problem
• On the approximability of the maximum induced matching problem
• Distance-2-matchings of random graphs
• New results on induced matchings
• Conflict analysis in mixed integer programming
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• The strong chromatic index ofC4-free graphs
• Evolutionary Credibility Theory

This page was built for publication: A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem