Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros

2012 ◽  
Vol 3 (3) ◽  
pp. 87-97 ◽  
Author(s):  
Sarbjit Singh
Keyword(s):  
Assignment Problem ◽  
Easy Method ◽  
Hungarian Algorithm ◽  
Assignment Algorithm

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.

scholarly journals A Fast Dynamic Assignment Algorithm for Solving Resource Allocation Problems

2021 ◽  
Vol 6 (1) ◽  
pp. 118
Author(s):  
Ivanda Zevi Amalia ◽  
Ahmad Saikhu ◽  
Rully Soelaiman
Keyword(s):  
Resource Allocation ◽  
Assignment Problem ◽  
Optimal Solution ◽  
Test Results ◽  
Maximum Weight ◽  
Hungarian Algorithm ◽  
Dynamic Assignment ◽  
Assignment Algorithm ◽  
Allocation Problems ◽  
Fast Dynamic

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 solution becomes ineffective because it takes up a lot of time and memory. This paper proposed a fast dynamic assignment algorithm based on the Hungarian algorithm. The proposed algorithm is able to obtain an optimal solution without performing the initialization process from the beginning. Based on the test results, the proposed algorithm has an average time of 0.146 s and an average memory of 4.62 M. While the Hungarian algorithm has an average time of 2.806 s and an average memory of 4.65 M. The fast dynamic assignment algorithm is influenced linearly by the number of change operations and quadratically by the number of vertices.

scholarly journals Distributed Algorithm for Base Station Assignment in 4G/5G Machine-Type Communication Scenarios with Backhaul Limited Conditions

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6553
Author(s):  
Edgar A. Esquivel-Mendiola ◽  
Hiram Galeana-Zapién ◽  
David H. Covarrubias ◽  
Edwin Aldana-Bobadilla
Keyword(s):  
Assignment Problem ◽  
Path Loss ◽  
Base Station ◽  
System Throughput ◽  
Dual Decomposition ◽  
Minimum Path ◽  
Machine Type ◽  
Assignment Algorithm ◽  
Communication Devices ◽  
Machine Type Communication

A progressive paradigm shift from centralized to distributed network architectures has been consolidated since the 4G communication standard, calling for novel decision-making mechanisms with distributed control to operate at the network edge. This situation implies that each base station (BS) must manage resources independently to meet the quality of service (QoS) of existing human-type communication devices (HTC), as well as the emerging machine type communication (MTC) devices from the internet of things (IoT). In this paper, we address the BS assignment problem, whose aim is to determine the most appropriate serving BS to each mobile device. This problem is formulated as an optimization problem for maximizing the system throughput and imposing constraints on the air interface and backhaul resources. The assignment problem is challenging to solve, so we present a simple yet valid reformulation of the original problem while using dual decomposition theory. Subsequently, we propose a distributed price-based BS assignment algorithm that performs at each BS the assignment process, where a novel pricing update scheme is presented. The simulation results show that our proposed solution outperforms traditional maximum signal to interference plus noise ratio (Max-SINR) and minimum path-loss (Min-PL) approaches in terms of system throughput.

Weapon Target Assignment Problem Solving Based on Hungarian Algorithm

2015 ◽  
Vol 713-715 ◽  
pp. 2041-2044 ◽  
Author(s):  
Yuan Zeng Cheng ◽  
Pei Chao Zhang ◽  
Bin Qian Cao
Keyword(s):  
Mathematical Model ◽  
Problem Solving ◽  
Assignment Problem ◽  
Weapon System ◽  
Hungarian Algorithm ◽  
Target Assignment ◽  
Modern Warfare

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.

scholarly journals Hungarian-Puzzled Text with Dynamic Quadratic Embedding Steganography

2017 ◽  
Vol 7 (2) ◽  
pp. 799
Author(s):  
Ebrahim Alrashed ◽  
Suood Suood Alroomi
Keyword(s):  
Exponential Growth ◽  
Assignment Problem ◽  
Ease Of Use ◽  
Secret Message ◽  
Least Significant Bit ◽  
Digital Medium ◽  
Stego Image ◽  
High Quality ◽  
Hungarian Algorithm ◽  
Embedding Technique

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 sequence. The embedding technique is also text dependent and has non-bounded inputs, making the possibilities of decoding infinite. Due to the exponential growth of and quadratic embedding, a novel cyclic technique is also introduced for the sequence that goes beyond the limits of the cover medium. The proposed method also aims to reduce the noise arising from embedding the secret message by reducing bits changed. This is done by partitioning the cover medium and the secret message into N partitions and artificially creating an assignment problem based on bit change criteria. The assignment problem will be solved using the Hungarian algorithm that will puzzle the secret message partition for an overall least bit change.

OPTIMAL SUBCUBE ASSIGNMENT FOR PARTITIONABLE HYPERCUBES

1992 ◽  
Vol 02 (01) ◽  
pp. 89-95
Author(s):  
RAMESH KRISHNAMURTI ◽  
BHAGIRATH NARAHARI
Keyword(s):  
Execution Time ◽  
Assignment Problem ◽  
Parallel Architectures ◽  
Log P ◽  
Optimal Assignment ◽  
Assignment Algorithm ◽  
Multiple Tasks ◽  
Independent Tasks

This paper formulates and discusses a processor assignment problem arising in partitionable parallel architectures. A partitionable hypercube multiprocessor can simultaneously execute multiple tasks where each task is independently executed on a subcube. Given a p processor hypercube and n independent tasks, where a task can be assigned a subcube of any size, an assignment determines the size of the subcube — i.e., the number of processors — to be assigned to each task. The objective of our problem is to find the optimal assignment which minimizes the maximum execution time among all tasks. We present an O(n log p max { log log p, log n}) algorithm that determines an optimal assignment. This algorithm can be efficiently parallelized, on the p processor hypercube, to obtain an O((n/p) log p log 2(n log p)) parallel assignment algorithm.

scholarly journals Wavelength Assignment Algorithm for optical networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1049-1054
Author(s):  
Gulzar Ahmad Dar ◽  
Hardeep singh Saini
Keyword(s):  
Optical Networks ◽  
Assignment Problem ◽  
Optical Network ◽  
Wavelength Assignment ◽  
Assignment Algorithm ◽  
Better Than

Wavelength assignment problem is one of the important problem in optical networks as on the first stage the route of the optical network is to be selected and after the route is selected then the wavelength is to be assigned to that route. In this paper we have proposed a wavelength assignment technique for the better performance of the optical network. The results have proved it better than the conventional algorithms.

scholarly journals DECISION MAKING IN THE ASSIGNMENT PROCESS BY USING THE HUNGARIAN ALGORITHM WITH OWA OPERATORS

2015 ◽  
Vol 21 (5) ◽  
pp. 684-704 ◽  
Author(s):  
Emili VIZUETE-LUCIANO ◽  
José M. MERIGÓ ◽  
Anna M. GIL-LAFUENTE ◽  
Sefa BORIA-REVERTER
Keyword(s):  
Decision Making ◽  
Aggregation Operators ◽  
Weighted Averaging ◽  
Arithmetic Means ◽  
Owa Operators ◽  
Hungarian Algorithm ◽  
Assignment Algorithm ◽  
Wide Range ◽  
Decision Making Problem ◽  
Parameterized Family

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 this approach is that we can provide a parameterized family of aggregation operators between the minimum and the maximum. Thus, the information can be represented in a more complete way. Furthermore, we also present a general framework by using generalized and quasi-arithmetic means. Therefore, we can consider a wide range of particular cases including the Euclidean and the Minkowski distance. The paper ends with a practical application of the new approach in a financial decision making problem regarding the assignment of investments.

Application of Hungarian Algorithm for Assignment Problem

2021 ◽  
Author(s):  
Ventseslav Kirilov Shopov ◽  
Vanya Dimitrova Markova
Keyword(s):  
Assignment Problem ◽  
Hungarian Algorithm

Hungarian algorithm for subcarrier assignment problem using GPU and CUDA

2018 ◽  
Vol 32 (4) ◽  
pp. e3884 ◽  
Author(s):  
Satyendra Singh Yadav ◽  
Paulo Alexandre Crisóstomo Lopes ◽  
Aleksandar Ilic ◽  
Sarat Kumar Patra
Keyword(s):  
Assignment Problem ◽  
Hungarian Algorithm ◽  
Subcarrier Assignment
Sign in / Sign up

Export Citation Format

Share Document