A Recurrent Algorithm to Solve the Weighted Matching Problem-Reference-Cited by-同舟云学术

A Recurrent Algorithm to Solve the Weighted Matching Problem

Published:2016-09 Issue:5 Volume:52 Page:748-757
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Matsiy O. B.,Morozov A. V.,Panishev A. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-016-9876-4.pdf

Reference4 articles.

1. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Ser. Dover Books on Computer Science, Dover Publ. (1998).

2. L. Lovász and M. D. Plummer, Matching Theory, Akadémiai Kiadó, Budapest (1986).

3. F. Harary, Graph Theory, Westwiew Press (1994).

4. O. B. Matsiy, A. V. Morozov, and A. V. Panishev, “Fast algorithm to find 2-factor of minimum weight,” Cybern. Syst. Analysis, 52, No. 3, 467–474 (2016).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Boolean Satisfiability Problem: Discrete and Continuous Reformulations with Applications;2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET);2020-02

2. Approaches to Solving Basic Problems of Closed Routes;2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET);2020-02

3. 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;EUREKA: Physics and Engineering;2017-03-31