• Home
  • Search
  • A new technique for modifying the Hungarian method
  • Cite Icon1
  • https://doi.org/10.1063/5.0114815Copy DOI Icon

A new technique for modifying the Hungarian method

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The classical method (the Hungarian method) aims to find the optimal solution for the assignment problems (AP). In this work, we introduced a new modification to the Hungarian method to solve (AP). First, we have to subtract the least element in each row from all elements of that row, every row and column must contain at least a zero and extends the least number of lines on the zeros. If the number of matrix rows (or columns) is equivalent to the number of extended lines, then we reach to the optimal solution, if it is not equal, then subtract the least uncovered element from all the elements in the matrix except the zeros until the number of rows (or columns) is equal to extend lines, then determine the cells that give optimal solution. By comparing with the Hungarian method, the results are equal, moreover, the new technique surpasses the Hungarian method with ease and simplicity steps, and it reaches the optimal solution faster and with less steps.

Similar Papers
  • Research Article
  • Citations11

Development of an accelerating hungarian method for assignment problems

  • Aug 31, 2020
  • Eastern-European Journal of Enterprise Technologies
  • Elias Munapo
  • Research Article
  • Citations2

할당 문제의 단순한 해법

  • Oct 31, 2012
  • The Journal of the Institute of Webcasting, Internet and Telecommunication
  • Sang-Un Lee
  • Research Article
  • Citations1

GEZGİN SATICI PROBLEMİNİN ÇÖZÜMÜ İÇİN MACAR ALGORİTMASI ESASLI YENİ BİR ÇÖZÜM YAKLAŞIMI

  • Sep 15, 2019
  • Mühendislik Bilimleri ve Tasarım Dergisi
  • Kenan Karagül
  • Conference Article
  • Citations55

Solving large-scale assignment problems by Kuhn-Munkres algorithm

  • Jan 01, 2016
  • Hong Cui +3
  • PDF
  • Research Article
  • Citations27

Using Interval Operations in the Hungarian Method to Solve the Fuzzy Assignment Problem and Its Application in the Rehabilitation Problem of Valuable Buildings in Egypt

  • Sep 14, 2020
  • Complexity
  • M A Elsisy +2
  • Research Article
  • Citations23

Spatial conservation planning under uncertainty using modern portfolio theory and Nash bargaining solution

  • Mar 10, 2020
  • Ecological Modelling
  • Alvaro Sierra-Altamiranda +5
  • Conference Article
  • Citations2

A differentiable approximation for the Linear Sum Assignment Problem with Edition

  • Aug 21, 2022
  • Luc Brun +4
  • Research Article
  • Citations8

URBER: Ultrafast Rule-Based Escape Routing Method for Large-Scale Sample Delivery Biochips

  • Jan 01, 2020
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Jiayi Weng +5
  • Book Chapter

Fuzzy Multi-Criteria Assignment Problems Using Two-Dimensional Fuzzy Soft Set Theory

  • Jan 01, 2016
  • Shyamal Kumar Mondal
  • Conference Article
  • Citations2

Job Assignment Problem on Online Transportation Order Using Hungarian Algorithm

  • Nov 10, 2022
  • Andreas Handojo +3
  • Research Article
  • Citations121

On Kuhn's Hungarian Method—A tribute from Hungary

  • Dec 09, 2004
  • Naval Research Logistics (NRL)
  • András Frank
  • Conference Article
  • Citations1

Adaptive spectrum aggregation for opportunistic resource management in multichannel networks

  • Sep 01, 2017
  • Chabalala S Chabalala +1
  • Research Article
  • Citations65

GPU-accelerated Hungarian algorithms for the Linear Assignment Problem

  • May 20, 2016
  • Parallel Computing
  • Ketan Date +1
  • Book Chapter

2 - LINEAR TRANSFORMATIONS AND MATRICES

  • Jan 01, 1962
  • Elements of Linear Spaces
  • A.R Amir-Moéz +1
  • Research Article
  • Citations12

Separation of convolved mixtures in frequency domain ICA

  • Jan 01, 2006
  • International Mathematical Forum
  • A Ciaramella +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.