A Recurrent Algorithm to Solve the Weighted Matching Problem

Matsiy, O. B.; Морозов, Андрій Васильович; Panishev, A. V.

doi:10.1007/s10559-016-9876-4

Cited by 4 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [13], a new method for solving the problem of weighted matching is described, the maximum matching in which is in time O(n 3 ). In the future, it is planned to modify the problem of matching with "vanishing" arcs, adding weight to the arcs.…”

Section: Introductionmentioning

confidence: 99%

Development of a Computational Experiment for the Paralleling of the Modified Branch and Bound Method for the Problem for the Appointment of Procedures to Patients in Sanatorium

Danylchenko

Kravchenko

2017

EUREKA: Physics and Engineering

View full text Add to dashboard Cite

For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound method was developed to find the maximum matching in a bipartite graph [1]. The algorithm takes into account the limits of compatibility procedures. The calculated experiment is aimed at proving the feasibility of paralleling of the optimal algorithm for solving the problem of scheduling the reception of medical procedures by patients for use in the sanatoriums of Ukraine. The experiment was carried out on computing platforms of different configurations with different computing power: a different number of processor cores, different amounts of memory, etc. Estimated minimum time scheduling, received at the computer platform with the maximum number of PCs is involved. Estimated time scheduling algorithm paralleling by using modifications of the branch and bound method is directly proportional to the number of vertices of a bipartite graph (which is equal to the sum of the number of procedures and the number of patients), the number of assigned procedures and restrictions.

show abstract

Section: Introductionmentioning

confidence: 99%