Log in

Relevant bibliographies by topics / Hungarian Algorithm for Assignment Problem / Journal articles

To see the other types of publications on this topic, follow the link: Hungarian Algorithm for Assignment Problem.

Journal articles on the topic 'Hungarian Algorithm for Assignment Problem'

Author: Grafiati

Published: 3 June 2025

Last updated: 20 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Hungarian Algorithm for Assignment Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Gabrovšek, Boštjan, Tina Novak, Janez Povh, Darja Rupnik Poklukar, and Janez Žerovnik. "Multiple Hungarian Method for k-Assignment Problem." Mathematics 8, no. 11 (2020): 2050. http://dx.doi.org/10.3390/math8112050.

Full text

Abstract:

The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: Graph Algorithms And Applications 2, World Scientific, 2004). The other three algorithms, Dm, Em, and Fm, incorporate randomization. Algorithm Dm can be considered as a greedy version of Bm, whereas Em and Fm are versions of local search algorithm, specialized for the k-matching problem. The algorithms are implemented in Python and are run on three da

APA, Harvard, Vancouver, ISO, and other styles

2

Cheng, Yuan Zeng, Pei Chao Zhang, and Bin Qian Cao. "Weapon Target Assignment Problem Solving Based on Hungarian Algorithm." Applied Mechanics and Materials 713-715 (January 2015): 2041–44. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.2041.

Full text

Abstract:

Weapon target assignment problem is most critical in modern warfare command decision of a problem for the weapon system and a relatively small number of targets assignment problem, you can use the Hungarian algorithm. Hungarian algorithm can solve the assignment problem, but under normal circumstances, weapon target assignment problem does not have the form of a mathematical model of assignment problem, through dummy weapon system or target method, the weapon target assignment problem is transformed into a standard assignment problem, and then solved by the Hungarian algorithm.

APA, Harvard, Vancouver, ISO, and other styles

3

Amalia, Ivanda Zevi, Ahmad Saikhu, and Rully Soelaiman. "A Fast Dynamic Assignment Algorithm for Solving Resource Allocation Problems." Jurnal Online Informatika 6, no. 1 (2021): 118. http://dx.doi.org/10.15575/join.v6i1.692.

Full text

Abstract:

The assignment problem is one of the fundamental problems in the field of combinatorial optimization. The Hungarian algorithm can be developed to solve various assignment problems according to each criterion. The assignment problem that is solved in this paper is a dynamic assignment to find the maximum weight on the resource allocation problems. The dynamic characteristic lies in the weight change that can occur after the optimal solution is obtained. The Hungarian algorithm can be used directly, but the initialization process must be done from the beginning every time a change occurs. The so

APA, Harvard, Vancouver, ISO, and other styles

4

Elias, Munapo. "DEVELOPMENT OF AN ACCELERATING HUNGARIAN METHOD FOR ASSIGNMENT PROBLEMS." Eastern-European Journal of Enterprise Technologies 4, no. 4 (106) (2020): 6–13. https://doi.org/10.15587/1729-4061.2020.209172.

Full text

Abstract:

The Hungarian method is a well-known method for solving the assignment problem. This method was developed and published in 1955. It was named the Hungarian method because two theorems from two Hungarian mathematicians were used. In 1957, it was noticed that this algorithm is strongly polynomial and has a complexity of order O(n<sup>4</sup>) This is the reason why the Hungarian method is also known as the Kuhn-Munkres algorithm. Later on, in 1971 the complexity of the method was improved to order O(n<sup>3</sup>) A smallest uncovered element is selected to create a single zero at every iteratio

APA, Harvard, Vancouver, ISO, and other styles

5

Jyoti, Arora, and Sharma Surbhi. "Solving Task Assignment Problem Using Branch and Bound Method." Journal of Applied Mathematics and Statistical Analysis 4, no. 1 (2023): 1–7. https://doi.org/10.5281/zenodo.7813430.

Full text

Abstract:

<em>The main aim of this paper is to present an algorithm of Branch and Bound method for solving task assignment problem. The branch and bound approach is based on divide and conquer method in which large problem is divided into smaller subsets of solutions. Our algorithm calculates lower bounds on solutions to the Task Assignment problem, which is further divided into subsets. Experimental results show that this Branch and Bound method to solve Task Assignment problem shows better results than standard Hungarian Method. A Numerical example is taken to illustrate the solution procedure</em>

APA, Harvard, Vancouver, ISO, and other styles

6

Mie, Mie Aung, Yin Cho Yin, Htay Khin, and Soe Myint Khin. "Minimization of Assignment Problems." International Journal of Trend in Scientific Research and Development 3, no. 5 (2019): 1360–62. https://doi.org/10.5281/zenodo.3590803.

Full text

Abstract:

The assignment problem is a special type of linear programming problem and it is sub class of transportation problem. Assignment problems are defined with two sets of inputs i.e. set of resources and set of demands. Hungarian algorithm is able to solve assignment problems with precisely defined demands and resources.Nowadays, many organizations and competition companies consider markets of their products. They use many salespersons to improve their organizations marketing. Salespersons travel form one city to another city for their markets. There are some problems in travelling which salespeop

APA, Harvard, Vancouver, ISO, and other styles

7

Pesta Gultom, Elisma Putri Br Barus, Jupita Mariana Manullang, Emriahta Br Damanik, and Ribka Nduru. "Optimalisasi Penugasan Tidak Normal Menggunakan Metode Hungarian Maksimasi dan Minimisasi pada PT Abadi." Lokawati : Jurnal Penelitian Manajemen dan Inovasi Riset 3, no. 4 (2025): 149–58. https://doi.org/10.61132/lokawati.v3i4.1960.

Full text

Abstract:

This study explores the optimization of non-normal assignments utilizing the Hungarian method for both maximization and minimization. The Hungarian algorithm is a combinatorial optimization technique that efficiently solves assignment problems, ensuring optimal allocation of resources. By applying this method to non-normal assignment scenarios, we aim to demonstrate its effectiveness in enhancing productivity and reducing costs in various industries. The findings indicate that the Hungarian method can significantly improve decision-making processes in complex assignment frameworks, leading to

APA, Harvard, Vancouver, ISO, and other styles

8

Vishal, Mehta, and Saxena Rajendra. "Role of the Assignment Problem in Resource Optimization: A Case Study of a Clothing manufacturing company." Career Point International Journal of Research(CPIJR) 4, no. 3 (2025): 7–11. https://doi.org/10.5281/zenodo.15054398.

Full text

Abstract:

Mathematics, particularly optimization techniques, plays a crucial role in management, helping to allocate resources efficiently. This paper explores the use of the Assignment Problem in operations management, where products or tasks must be assigned to resources such as workers, machines, or locations. Through a case study of a clothing manufacturing company, we demonstrate how the Assignment Problem can optimize production assignments for different machines to minimize overall production costs. The Hungarian algorithm is applied to solve the problem.

APA, Harvard, Vancouver, ISO, and other styles

9

R.Jeba, Mary, and Devi K.Aasha. "Aberrant Method of Solving the Assignment Problem." Journal of Statistics and Mathematical Engineering 4, no. 3 (2018): 8–13. https://doi.org/10.5281/zenodo.1477228.

Full text

Abstract:

Assignment downside may be a specific case of the transportation downside. It helps as to minimizing the time or cost of manufacturing the products by allocating one job to one person or one person to one job or one destination to one origin or one origin to one destination only. Normally, assignment model is a minimization model. In this article we have a tendency to initiate new technique to resolve assignment downside referred to as aberrant technique of determination assignment downside. By solving an assignment problem using aberrant method of solving assignment problem and Hungarian meth

APA, Harvard, Vancouver, ISO, and other styles

10

VIZUETE-LUCIANO, Emili, José M. MERIGÓ, Anna M. GIL-LAFUENTE, and Sefa BORIA-REVERTER. "DECISION MAKING IN THE ASSIGNMENT PROCESS BY USING THE HUNGARIAN ALGORITHM WITH OWA OPERATORS." Technological and Economic Development of Economy 21, no. 5 (2015): 684–704. http://dx.doi.org/10.3846/20294913.2015.1056275.

Full text

Abstract:

Assignment processes permit to coordinate two set of variables so each variable of the first set is connected to another variable of the second set. This paper develops a new assignment algorithm by using a wide range of aggregation operators in the Hungarian algorithm. A new process based on the use of the ordered weighted averaging distance (OWAD) operator and the induced OWAD (IOWAD) operator in the Hungarian algorithm is introduced. We refer to it as the Hungarian algorithm with the OWAD operator (HAOWAD) and the Hungarian algorithm with the IOWAD operator (HAIOWAD). The main advantage of

APA, Harvard, Vancouver, ISO, and other styles

11

Yadav, Satyendra Singh, Paulo Alexandre Crisóstomo Lopes, Aleksandar Ilic, and Sarat Kumar Patra. "Hungarian algorithm for subcarrier assignment problem using GPU and CUDA." International Journal of Communication Systems 32, no. 4 (2018): e3884. http://dx.doi.org/10.1002/dac.3884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vendrell, Joan, and Solmaz Kia. "Quantum-Inspired Evolutionary Algorithm for Optimal Service-Matching Task Assignment." Information 13, no. 9 (2022): 438. http://dx.doi.org/10.3390/info13090438.

Full text

Abstract:

This paper proposes a quantum-inspired evolutionary algorithm (QiEA) to solve an optimal service-matching task-assignment problem. Our proposed algorithm comes with the advantage of generating always feasible population individuals and, thus, eliminating the necessity for a repair step. That is, with respect to other quantum-inspired evolutionary algorithms, our proposed QiEA algorithm presents a new way of collapsing the quantum state that integrates the problem constraints in order to avoid later adjusting operations of the system to make it feasible. This results in lower computations and a

APA, Harvard, Vancouver, ISO, and other styles

13

Moqbel Hassan Al-ZUBAYDI, Nadia. "ANALYSIS AND EMPLOYING OF HUNGARIAN ALGORITHM USING KRUSKAL'S METHOD FOR ASSIGNMENT PROBLEM." MINAR International Journal of Applied Sciences and Technology 2, no. 3 (2020): 01–09. http://dx.doi.org/10.47832/2717-8234.3-2.1.

Full text

Abstract:

The assignment problem is important matter in the field of information technology, because It treats with assigning one of methods of managing a set of works estimated as (n) that are Symbolized (W1, W2, W3,…..Wn) by using one of available machines that are Symbolized (M1, M2, M3,…..Mn), with minimum cost which is counted by (∑Cij). There are several methods handling this case such as Hungarian‟s method. In this paper, will been use graphs by converting an assignment into a complete bipartite graph using Kruskal‟s Algorithm in order to find the minimum spanning tree, and obtaining the most opt

APA, Harvard, Vancouver, ISO, and other styles

14

M Muley, Yogesh. "SOLVING THE ASSIGNMENT PROBLEM VIA THE ABSOLUTE DIFFERENCE CALCULATION ALGORITHM." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 15, no. 3 (2024): 442–58. https://doi.org/10.61841/turcomat.v15i3.15270.

Full text

Abstract:

The assignment problem is a fundamental combinatorial optimization challenge with applications across industries, where resources must be assigned to tasks in a cost-efficient manner. Traditional approaches, such as the Hungarian algorithm, minimize assignment costs by reducing the matrix to an optimal form. This study introduces an alternative approach using an "absolute difference calculation" algorithm, in which each element’s difference from the minimum or maximum in its row is evaluated and adjusted iteratively to ensure feasible solutions and finally MATLAB program is used to solve examp

APA, Harvard, Vancouver, ISO, and other styles

15

Singh, Sarbjit. "Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros." International Journal of Operations Research and Information Systems 3, no. 3 (2012): 87–97. http://dx.doi.org/10.4018/joris.2012070106.

Full text

Abstract:

The Assignment algorithm is around 54 years old and a lot of work has been done on this algorithm. In this study various aspect of assignment algorithm has been considered. The endeavor of this note is to make solution of assignment problem so simple that even class tenth student can easily solve it. One of the most important aspects of assignment algorithm (Hungarian Algorithm) is to draw lines to cover all the zeros, in this study a new and easy method has been proposed to cover all the zeros, which helps to make this algorithm easy.

APA, Harvard, Vancouver, ISO, and other styles

16

Mondal, Ranjan Kumar, Payel Ray, Enakshmi Nandi, Biswajit.Biswas, Manas Kumar Sanyal, and Debabrata Sarddar. "Load Balancing of Unbalanced Assignment Problem With Hungarian Method." International Journal of Ambient Computing and Intelligence 10, no. 1 (2019): 46–60. http://dx.doi.org/10.4018/ijaci.2019010103.

Full text

Abstract:

The cloud computing presents a type of assignments and systems which occupy distributed resources to execute a role in a distributed way. Cloud computing make use of the online systems on the web to assist the implementation of complicated assignments; that need huge-scale computation. It was said with the intention of in our living world; we can find it challenging to balance workloads of cloud computing among assignments (jobs or tasks) and systems (machines or nodes), so the majority of the time we have to promote a condition to unbalanced assignment problems (unequal task allocations). The

APA, Harvard, Vancouver, ISO, and other styles

17

Hieronymus, Magnus, and Jonas Nycander. "Finding the Minimum Potential Energy State by Adiabatic Parcel Rearrangements with a Nonlinear Equation of State: An Exact Solution in Polynomial Time." Journal of Physical Oceanography 45, no. 7 (2015): 1843–57. http://dx.doi.org/10.1175/jpo-d-14-0174.1.

Full text

Abstract:

AbstractThe problem of finding the state of minimum potential energy through the rearrangement of water parcels with a nonlinear equation of state is discussed in the context of a combinatorial optimization problem. It is found that the problem is identical to a classical optimization problem called the linear assignment problem. This problem belongs to a problem class known as P, a class of problems that have known efficient solutions. This is very fortunate since this study’s problem has been suggested to be an asymmetric traveling salesman problem. A problem that belongs to a class called N

APA, Harvard, Vancouver, ISO, and other styles

18

Elsisy, M. A., A. S. Elsaadany, and M. A. El Sayed. "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." Complexity 2020 (September 14, 2020): 1–11. http://dx.doi.org/10.1155/2020/9207650.

Full text

Abstract:

Assignment problem (AP) is an entrenched tool for solving engineering and management problems. The Hungarian method is always used to fathom the AP in crisp cases. This paper presents an algorithm of finding the optimum solution of the fuzzy AP by using the modified Hungarian method. This method is utilized to get a minimum assignment cost in the fuzzy environment for a fuzzy AP. Firstly, we use the fuzzy numbers without any transformation. Secondly, the fuzzy AP is transformed into an interval AP based on the α-cut methodology. Then, the interval arithmetic operations and the order relations

APA, Harvard, Vancouver, ISO, and other styles

19

Chi-Jen, Lin, and Lin Wan-Ting. "A systematic weighted-Hungarian-algorithm for optimization and postoptimal analysis of transportation problem." Journal of Statistics and Management Systems 26, no. 4 (2023): 843–66. http://dx.doi.org/10.47974/jsms-936.

Full text

Abstract:

This paper first proposes an easy algorithm for optimizing the transportation problem. Then, optimization procedures of the algorithm are applied for sensitivity analysis and the parametric analysis. The efficient algorithm can be proceeded systematically and smoothly. Some numerical examples are given to demonstrate these procedures. The attractive features of the new algorithms include: (1) The algorithm for solving the optimal solution of the transportation problem is an easy weighted Hungarian algorithm that can be applied to transportation problem and assignment problem; (2) The algorithm

APA, Harvard, Vancouver, ISO, and other styles

20

Vásconez, Juan Pablo, Elias Schotborgh, Ingrid Nicole Vásconez, et al. "Smart Delivery Assignment through Machine Learning and the Hungarian Algorithm." Smart Cities 7, no. 3 (2024): 1109–25. http://dx.doi.org/10.3390/smartcities7030047.

Full text

Abstract:

Intelligent transportation and advanced mobility techniques focus on helping operators to efficiently manage navigation tasks in smart cities, enhancing cost efficiency, increasing security, and reducing costs. Although this field has seen significant advances in developing large-scale monitoring of smart cities, several challenges persist concerning the practical assignment of delivery personnel to customer orders. To address this issue, we propose an architecture to optimize the task assignment problem for delivery personnel. We propose the use of different cost functions obtained with deter

APA, Harvard, Vancouver, ISO, and other styles

21

Dhanasekar, S., Saroj Kumar Dash, and S. Hariharan. "Hungarian Algorithm using Haar Tuples to Solve Fuzzy Travelling Salesman Problem." International Journal of Engineering & Technology 7, no. 4.10 (2018): 380. http://dx.doi.org/10.14419/ijet.v7i4.10.20941.

Full text

Abstract:

Travelling salesman problem(TSP) deals with visiting all the given cities and return back to the starting city with the minimum travelling distance or minimum travelling cost where each city is visited exactly once. The TSP problem is a special kind of an assignment model that excludes sub tours. In this paper we used Haar Hungarian algorithm approach [13] to solve a Fuzzy Travelling Salesman Problem (FTSP) and Numerical examples are given to validate the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

22

Shen, XiaoDong, and Lei Chen. "Configuration Transformation Planning Method of Unmanned Aerial Vehicle Cluster Based on Improved Hungarian Algorithm." Journal of Physics: Conference Series 2283, no. 1 (2022): 012001. http://dx.doi.org/10.1088/1742-6596/2283/1/012001.

Full text

Abstract:

Abstract For the planning problem of Unmanned Aerial Vehicle (UAV) formation configuration transformation, a formation configuration transformation planning method based on the improved Hungarian algorithm is proposed. By selecting a straight-line path as the movement path of UAVs in configuration transformation, the configuration transformation problem is transformed into a multi-UAV position assignment problem with constraint handling in a dynamic environment. For the Hungarian algorithm efficiency matrix power function treatment, the improved algorithm can be simultaneously bivariate integr

APA, Harvard, Vancouver, ISO, and other styles

23

Shen, XiaoDong, and Lei Chen. "Configuration Transformation Planning Method of Unmanned Aerial Vehicle Cluster Based on Improved Hungarian Algorithm." Journal of Physics: Conference Series 2283, no. 1 (2022): 012001. http://dx.doi.org/10.1088/1742-6596/2283/1/012001.

Full text

Abstract:

Abstract For the planning problem of Unmanned Aerial Vehicle (UAV) formation configuration transformation, a formation configuration transformation planning method based on the improved Hungarian algorithm is proposed. By selecting a straight-line path as the movement path of UAVs in configuration transformation, the configuration transformation problem is transformed into a multi-UAV position assignment problem with constraint handling in a dynamic environment. For the Hungarian algorithm efficiency matrix power function treatment, the improved algorithm can be simultaneously bivariate integr

APA, Harvard, Vancouver, ISO, and other styles

24

Goyal, Pinky. "Optimal Assignment of Cabin Crew in Airlines." International Journal for Research in Applied Science and Engineering Technology 13, no. 5 (2025): 6382–90. https://doi.org/10.22214/ijraset.2025.71695.

Full text

Abstract:

Abstract: The aviation industry faces complex challenges in efficiently managing cabin crew assignments while ensuring operational efficiency, regulatory compliance, and high service quality. This project aims to develop a systematic approach to optimize cabin crew allocation using the Hungarian method, with Indigo Airlines as the primary case study. The project focuses on developing a mathematical optimization model that incorporates critical factors, including flight schedules, duty time limitations, and mandatory rest periods. The Hungarian algorithm is applied to operational data from Indi

APA, Harvard, Vancouver, ISO, and other styles

25

Mamoulis, Nikos. "Technical Perspective." ACM SIGMOD Record 51, no. 1 (2022): 50. http://dx.doi.org/10.1145/3542700.3542712.

Full text

Abstract:

The optimal assignment problem is a classic combinatorial optimization problem. Given a set of n agents A, a set T of m tasks, and an n×m cost matrix C, the objective is to find the matching between A and T, which minimizes or maximizes an aggregate cost of the assigned agent-task pairs. In its standard definition, n = m and we are looking for the 1-to-1 matching with the minimum total cost. From a graph theory perspective, this is a weighted bipartite graph matching problem. A classic algorithm for solving the assignment problem is the Hungarian algorithm (a.k.a. Kuhn-Munkres algorithm) [3],

APA, Harvard, Vancouver, ISO, and other styles

26

Ebrahim, Alrashed, and Suood Alroomi Suood. "Hungarian-Puzzled Text with Dynamic Quadratic Embedding Steganography." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 2 (2017): 799–809. https://doi.org/10.11591/ijece.v7i2.pp799-809.

Full text

Abstract:

Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding seq

APA, Harvard, Vancouver, ISO, and other styles

27

Date, Ketan, and Rakesh Nagi. "GPU-accelerated Hungarian algorithms for the Linear Assignment Problem." Parallel Computing 57 (September 2016): 52–72. http://dx.doi.org/10.1016/j.parco.2016.05.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Murugesan, R. "E-SOFT - A VERY SIMPLE AND INNOVATIVE METHOD FOR SOLVING UNBALANCED ASSIGNMENT PROBLEMS." International Journal of Advanced Research 10, no. 05 (2022): 994–1005. http://dx.doi.org/10.21474/ijar01/14806.

Full text

Abstract:

In this paper, we have proposed a noveland innovative method entitled E-SOFT fordetermining the optimal assignment plans to the unbalanced assignment problems (UAPs) and viewed its performance with the existing Hungarian method and the Mantra technique. The ESOFT algorithm has beeninheritedfrom the existing SOFTMIN algorithm developed for solving transportation problems and also extended for solving the UAPs.The Extended SOFTMIN method is in short termed as E-SOFT method. The performance of the proposed E-SOFT method over the Hungarian and Mantra methods has been tested on a set of 20 identifi

APA, Harvard, Vancouver, ISO, and other styles

29

Pérez-Cañedo, Boris, and Eduardo R. Concepción-Morales. "A Lexicographic Approach to Fuzzy Linear Assignment Problems with Different Types of Fuzzy Numbers." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 28, no. 03 (2020): 421–41. http://dx.doi.org/10.1142/s0218488520500178.

Full text

Abstract:

The fuzzy linear assignment problem (FLAP) is an extension of the classical linear assignment problem (LAP) to situations in which uncertainty in the cost coefficients is represented by fuzzy numbers. FLAP applications range from the assignment of workers to tasks to multiple-criteria decision analysis in fuzzy environments and many other engineering applications. Most FLAP formulations assume that all cost coefficients are fuzzy numbers of the same type (e.g. triangular, trapezoidal). The standard solution approach is the defuzzification of the cost coefficients, thus transforming the FLAP in

APA, Harvard, Vancouver, ISO, and other styles

30

Sha’ban, Ruqaya. "A Hybrid Ant Colony Optimization Algorithm to Solve Assignment Problem by Hungarian Method." AL-Rafidain Journal of Computer Sciences and Mathematics 6, no. 2 (2009): 159–75. http://dx.doi.org/10.33899/csmj.2009.163805.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ji, Ping, W. B. Lee, and Hongyu Li. "A new algorithm for the assignment problem: An alternative to the Hungarian method." Computers & Operations Research 24, no. 11 (1997): 1017–23. http://dx.doi.org/10.1016/s0305-0548(97)00019-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Tingpeng, Li, Li Yue, and Qian Yanling. "Improved Hungarian algorithm for assignment problems of serial-parallel systems." Journal of Systems Engineering and Electronics 27, no. 4 (2016): 858–70. http://dx.doi.org/10.21629/jsee.2016.04.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Juan, Miguel J. Bawagan. "A Kidney Exchange Matching Application Using the Blossom and Hungarian Algorithms for Pairwise and Multiway Matching." Indian Journal of Science and Technology 13, no. 2 (2020): 229–47. https://doi.org/10.17485/ijst/2020/v13i02/149446.

Full text

Abstract:

Abstract <strong>Background/objectives:</strong> Patients of kidney failure sometimes have incompatible donors. This study proposes an application to get the best matchings based on scoring data. <strong>Methods:</strong> For pairwise matching, we created a new graph from the original scoring matrix. This graph ensures pairwise matchings. To find an optimal matching, we used the Blossom algorithm. For multiway matching, we interpreted the scoring matrix as an assignment problem. For this, we used the Hungarian algorithm. The application was created using Python, NetworkX, NumPy, and

APA, Harvard, Vancouver, ISO, and other styles

34

Guo, Chuijiang, and Dingyou Lei. "Model of Wagons’ Placing-In and Taking-Out Problem in a Railway Station and Its Heuristic Algorithm." Mathematical Problems in Engineering 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/493809.

Full text

Abstract:

Placing-in and taking-out wagons timely can decrease wagons’ dwell time in railway stations, improve the efficiency of railway transportation, and reduce the cost of goods transportation. We took the locomotive running times between goods operation sites as weights, so the wagons’ placing-in and taking-out problem could be regarded as a single machine scheduling problem,1pijCmax, which could be transformed into the shortest circle problem in a Hamilton graph whose relaxation problem was an assignment problem. We used a Hungarian algorithm to calculate the optimal solution of the assignment pro

APA, Harvard, Vancouver, ISO, and other styles

35

Hu, Yifei, Wenbin Gong, and Fangming Zhou. "A Lyapunov-Optimized Dynamic Task Offloading Strategy for Satellite Edge Computing." Applied Sciences 13, no. 7 (2023): 4281. http://dx.doi.org/10.3390/app13074281.

Full text

Abstract:

Satellite edge computing (SEC) has garnered significant attention for its potential to deliver services directly to users. However, the uneven distribution of receiving tasks among satellites in the constellation can lead to uneven utilization of computing resources. This paper proposes a task offloading strategy for SEC that aims to minimize the average delay and energy consumption of tasks by assigning them to appropriate satellite nodes. The approach uses Lyapunov optimization to convert the long-term optimization problem with task queue length constraints into an assignment problem within

APA, Harvard, Vancouver, ISO, and other styles

36

Maksimenko, Aleksandr N. "Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm." Modeling and Analysis of Information Systems 27, no. 1 (2020): 72–85. http://dx.doi.org/10.18255/1818-1015-2020-1-72-85.

Full text

Abstract:

In this paper, we consider the notion of a direct type algorithm introduced by V. A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. the concept of a direct type algorithm is determined using the graph of solutions of a combinatorial optimization problem. e vertices of this graph are all feasible solutions of a problem. Two solutions are called adjacent if there are input data for which these and only these solutions are optimal. A key feature of direct type algorithms is that their complexity is bounded from below by the clique number of th

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Kai Ming, Chun Qing Ruan, Yuan An Liu, Xiao Yu Cheng, and Fang Liu. "An Efficient Joint Subcarrier Pairing and Resource Allocation for Multi-Relay OFDM Systems." Applied Mechanics and Materials 696 (November 2014): 207–14. http://dx.doi.org/10.4028/www.scientific.net/amm.696.207.

Full text

Abstract:

For multi-relay orthogonal frequency division multiplexing (OFDM) systems, efficient subcarrier pairing and resource allocation are significant to boost the system performance. We study the joint optimization problem of subcarrier assignment, subcarrier pairing and power allocation, to maximize the system transmission rate under a total power constraint. Many previous works formulate such a problem as a mixed integer programming problem, then transform it into a convex optimization problem by continuous relaxation and pair all the subcarriers using Hungarian method, which requires high computa

APA, Harvard, Vancouver, ISO, and other styles

38

Hoang The Khanh. "Research on the weapon target assignment problem in the combined air defense missile system for training simulation." Journal of Military Science and Technology, CSCE5 (December 15, 2021): 83–92. http://dx.doi.org/10.54939/1859-1043.j.mst.csce5.2021.83-92.

Full text

Abstract:

In modern warfare, when the weapon system and the targets are constantly being improved and upgraded, ensuring the distribution of firepower to optimally destroy the target will help the commander to make quick and accurate decisions, thereby improving combat effectiveness. This paper proposes a method to build a command-control automatic system based on solving the weapon target assignment (WTA) problem in a combination of short and medium-range air defense missile systems so that the total damage of targets is maximum and the damage of protected area is minimum. Based on combinatorial optimi

APA, Harvard, Vancouver, ISO, and other styles

39

Li, Juan, Yanxin Zhang, and Wenbo Li. "Formation Control of a Multi-Autonomous Underwater Vehicle Event-Triggered Mechanism Based on the Hungarian Algorithm." Machines 9, no. 12 (2021): 346. http://dx.doi.org/10.3390/machines9120346.

Full text

Abstract:

Among the key technologies of Autonomous Underwater Vehicle (AUV) leader–follower formations control, formation reconfiguration technology is one of the main technologies to ensure that multiple AUVs successfully complete their tasks in a complex operating environment. The biggest drawback of the leader–follower formations technology is the failure of the leader and the excessive communication pressure of the leader. Aiming at the problem of leader failure in multi- AUV leader–follower formations, the Hungarian algorithm is used to reconstruct the failed formation with a minimum cost, and the

APA, Harvard, Vancouver, ISO, and other styles

40

Alrashed, Ebrahim, and Suood Suood Alroomi. "Hungarian-Puzzled Text with Dynamic Quadratic Embedding Steganography." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 2 (2017): 799. http://dx.doi.org/10.11591/ijece.v7i2.pp799-809.

Full text

Abstract:

Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding seq

APA, Harvard, Vancouver, ISO, and other styles

41

Koehl, Patrice, and Henri Orland. "A General Statistical Physics Framework for Assignment Problems." Algorithms 17, no. 5 (2024): 212. http://dx.doi.org/10.3390/a17050212.

Full text

Abstract:

Linear assignment problems hold a pivotal role in combinatorial optimization, offering a broad spectrum of applications within the field of data sciences. They consist of assigning “agents” to “tasks” in a way that leads to a minimum total cost associated with the assignment. The assignment is balanced when the number of agents equals the number of tasks, with a one-to-one correspondence between agents and tasks, and it is and unbalanced otherwise. Additional options and constraints may be imposed, such as allowing agents to perform multiple tasks or allowing tasks to be performed by multiple

APA, Harvard, Vancouver, ISO, and other styles

42

Hahn, Peter, Thomas Grant, and Nat Hall. "A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method." European Journal of Operational Research 108, no. 3 (1998): 629–40. http://dx.doi.org/10.1016/s0377-2217(97)00063-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wen, Jing, Dongwei Li, Linfeng Liu, and Jiabin Yuan. "An estimated Hungarian method for data forwarding problem in underwater wireless sensor networks." International Journal of Distributed Sensor Networks 14, no. 5 (2018): 155014771877253. http://dx.doi.org/10.1177/1550147718772538.

Full text

Abstract:

With the increasing concern over marine applications in recent years, the technology of underwater wireless sensor networks has received considerable attention. In underwater wireless sensor networks, the gathered data are sent to terrestrial control center through multi-hops for further processing. Underwater wireless sensor networks usually consist of three types of nodes: ordinary nodes, anchor nodes, and sink nodes. The data messages are transferred from an ordinary node or an anchored node to one of the sink nodes by discrete hops. Data forwarding algorithms are at the core position of un

APA, Harvard, Vancouver, ISO, and other styles

44

Pongchairerks, Pisut. "A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem." Sustainability 15, no. 5 (2023): 4289. http://dx.doi.org/10.3390/su15054289.

Full text

Abstract:

This paper proposes a probabilistic hill-climbing algorithm, called PH, for the single-source transportation problem (STP). PH is a tree search algorithm in which each node contains an assignment problem (AP) transformed from the STP being solved. The transformation converts each source’s product units into product lots; a product lot equals multiple product units. The AP aims to find the optimal assignment of product lots to destinations to minimize the total assignment cost. PH uses the Hungarian method to find the optimal solution of the AP in every node, which is a solution of the STP. For

APA, Harvard, Vancouver, ISO, and other styles

45

Song, Xin, Xiuwei Han, Yue Ni, Li Dong, and Lei Qin. "Joint Uplink and Downlink Resource Allocation for D2D Communications System." Future Internet 11, no. 1 (2019): 12. http://dx.doi.org/10.3390/fi11010012.

Full text

Abstract:

In cellular networks, device-to-device communications can increase the spectrum efficiency, but some conventional schemes only consider uplink or downlink resource allocation. In this paper, we propose the joint uplink and downlink resource allocation scheme which maximizes the system capacity and guarantees the signal-to-noise-and-interference ratio of both cellular users and device-to-device pairs. The optimization problem is formulated as a mixed integer nonlinear problem that is usually NP hard. To achieve the reasonable resource allocation, the optimization problem is divided into two sub

APA, Harvard, Vancouver, ISO, and other styles

46

Ahmed Younis, Ashraf A., and Adel M. Alsharkasi. "USING OF HUNGARIAN METHOD TO SOLVE THE TRANSPORTATION PROBLEMS." EPH - International Journal of Applied Science 2, no. 4 (2016): 11–17. http://dx.doi.org/10.53555/eijas.v2i4.135.

Full text

Abstract:

Transportation problems and Assignment Problems are considered as one of the most important applications of linear programming and are used to solve many economic and administrative problems. Transport issues are those matters that concern the transfer of certain products from the places of production or manufactured to the places of consumption or storage, through a special matrix containing figures for transport costs, in which the main objective is to make the cost of transport at a minimum value taking into account supply and demand constraints. There are several methods to solve these typ

APA, Harvard, Vancouver, ISO, and other styles

47

Adlakha, V., and H. Arsham. "Managing cost uncertainties in transportation and assignment problems." Journal of Applied Mathematics and Decision Sciences 2, no. 1 (1998): 65–104. http://dx.doi.org/10.1155/s1173912698000042.

Full text

Abstract:

In a fast changing global market, a manager is concerned with cost uncertainties of the cost matrix in transportation problems (TP) and assignment problems (AP).A time lag between the development and application of the model could cause cost parameters to assume different values when an optimal assignment is implemented. The manager might wish to determine the responsiveness of the current optimal solution to such uncertainties. A desirable tool is to construct a perturbation set (PS) of cost coeffcients which ensures the stability of an optimal solution under such uncertainties.The widely-use

APA, Harvard, Vancouver, ISO, and other styles

48

Rebbah, Mohammed, Yahya Slimani, Mohammed Debakla, and Omar Smail. "Toward A Performing Resource Provisioning Model for Hybrid Cloud." International Journal of Grid and High Performance Computing 10, no. 4 (2018): 15–42. http://dx.doi.org/10.4018/ijghpc.2018100102.

Full text

Abstract:

This article describes how the idea of a hybrid cloud comes from the coupling of public and private clouds to more efficiently address user requirements. This article addresses the problem of resource provisioning in hybrid cloud. This article is mainly concerned about optimizing the resources provisioning task through the reduction of the tasks completion time together with minimal cost and more reliable services. Two steps are considered in the proposed model, which are brokering and scheduling. In the brokering strategy, this article formalizes the problem as a minimization problem of the c

APA, Harvard, Vancouver, ISO, and other styles

49

E. Jayanthi. "An Innovative Modeling of Fuzzy Assignment Problem by Runge-Kutta Ranking (RKR) Method." Panamerican Mathematical Journal 35, no. 4s (2025): 228–34. https://doi.org/10.52783/pmj.v35.i4s.4672.

Full text

Abstract:

An Assignment problem is a unique variety of the Linear Programming Problem. In this article, the payoff outlay values of the Fuzzy Assignment Problem are measured as Fuzzy Numbers in particular, are considered as Triangular Fuzzy Numbers. First, the Fuzzy Numbers are rehabilitated into crisp standard values using fuzzy ranking methods. Then, the tremendous extreme solution of the Fuzzy Assignment Problem is acquired by a typical Hungarian’s algorithm technique. Now, Runge Kutta ranking method is a new proposed approach is demonstrated by a numerical example and compared our proposed technique

APA, Harvard, Vancouver, ISO, and other styles

50

Xu, Yisong, and Xinyu Zhuang. "Container Shipping Scheduling Method Based on the Evidence Reasoning Approach in Fluctuating CCFI and BDI Cycle." Mathematical Problems in Engineering 2022 (July 18, 2022): 1–10. http://dx.doi.org/10.1155/2022/3997361.

Full text

Abstract:

Due to the COVID-19/Omicron pandemic and the trade war and tariffs between China and America, the supply chain between Asia and America, or Asia and Europe, faced unprecedented challenges. With the outbreak of the Russian-Ukrainian war, the global supply chain has become increasingly unbalanced. In particular, the shortage of container ships and the continuous fluctuation of the BDI and CCFI make shipping scheduling increasingly important for ocean carriers. To solve this problem, in this study, we propose an analytic approach considering the fluctuation of BDI and CCFI based on interval evide

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!