Research and Implementation of Hungarian Method Based on the Structure Index Reduction for DAE Systems
Open Access
- 1 June 2014
- journal article
- Published by SAGE Publications in Journal of Algorithms & Computational Technology
- Vol. 8 (2) , 219-231
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Diagonally implicit Runge—Kutta methods for differential algebraic equations of indices two and threeComputational Mathematics and Mathematical Physics, 2010
- Modeling and simulation of fuel cell hybrid vehiclesInternational Journal of Automotive Technology, 2010
- Unified multi-domain modelling and simulation of space robot for capturing a moving targetMultibody System Dynamics, 2009
- On Kuhn's Hungarian Method—A tribute from HungaryNaval Research Logistics (NRL), 2004
- A Tree Projection Algorithm for Generation of Frequent Item SetsJournal of Parallel and Distributed Computing, 2001
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of SubdeterminantsSIAM Journal on Scientific Computing, 1996
- Matroid Intersection1979
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965