The Recurrent Method to Solve the Assignment Problem
Gespeichert in:
Verfasser / Beitragende:
[O. Matsiy, A. Morozov, A. Panishev]
Ort, Verlag, Jahr:
2015
Enthalten in:
Cybernetics and Systems Analysis, 51/6(2015-11-01), 939-946
Format:
Artikel (online)
Online Zugang:
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605518645 | ||
| 003 | CHVBK | ||
| 005 | 20210128100726.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151101xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10559-015-9786-x |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10559-015-9786-x | ||
| 245 | 0 | 4 | |a The Recurrent Method to Solve the Assignment Problem |h [Elektronische Daten] |c [O. Matsiy, A. Morozov, A. Panishev] |
| 520 | 3 | |a The paper proposes a new method to solve the assignment problem based on recursive derivation of the optimal solution. The assignment problem is formulated in the rearrangement matrix form that allows the use of the matrix approach to optimal solution. The algorithm is to find the minimum total weight matching in the bipartite graph with 2n vertices. The computational scheme of the recurrence method for solving the assignment problem is presented in the form adapted for implementation on a computer. | |
| 540 | |a Springer Science+Business Media New York, 2015 | ||
| 690 | 7 | |a assignment problem |2 nationallicence | |
| 690 | 7 | |a matching |2 nationallicence | |
| 690 | 7 | |a bipartite graph |2 nationallicence | |
| 690 | 7 | |a augmenting path |2 nationallicence | |
| 700 | 1 | |a Matsiy |D O. |u Kharkiv National Automobile and Highway University, Kharkiv, Ukraine |4 aut | |
| 700 | 1 | |a Morozov |D A. |u Zhytomyr State Technological University, Zhytomyr, Ukraine |4 aut | |
| 700 | 1 | |a Panishev |D A. |u Zhytomyr State Technological University, Zhytomyr, Ukraine |4 aut | |
| 773 | 0 | |t Cybernetics and Systems Analysis |d Springer US; http://www.springer-ny.com |g 51/6(2015-11-01), 939-946 |x 1060-0396 |q 51:6<939 |1 2015 |2 51 |o 10559 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10559-015-9786-x |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10559-015-9786-x |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Matsiy |D O. |u Kharkiv National Automobile and Highway University, Kharkiv, Ukraine |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Morozov |D A. |u Zhytomyr State Technological University, Zhytomyr, Ukraine |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Panishev |D A. |u Zhytomyr State Technological University, Zhytomyr, Ukraine |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Cybernetics and Systems Analysis |d Springer US; http://www.springer-ny.com |g 51/6(2015-11-01), 939-946 |x 1060-0396 |q 51:6<939 |1 2015 |2 51 |o 10559 | ||