Research and Implementation of Hungarian Method Based on the Structure Index Reduction for DAE Systems
Hungarian method is a classical method for solving assignment problems. It also can be widely used in other problems, such as matching problem. This paper researches its application on using structural index reduction method to solve high-index DAEs, based on the combinatorial relaxation theory. Com...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2014-06-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/1748-3018.8.2.219 |
| Summary: | Hungarian method is a classical method for solving assignment problems. It also can be widely used in other problems, such as matching problem. This paper researches its application on using structural index reduction method to solve high-index DAEs, based on the combinatorial relaxation theory. Combinatorial relaxation theory converts the complex mathematical problem to the matching problem of bipartite graph. Based on this theory this paper presents the main idea of Hungarian method and puts up three implementations for Hungarian method. At last, it compares the time performance of the three implementations by running a set of experiments. |
|---|---|
| ISSN: | 1748-3018 1748-3026 |