Application of Hungarian Algorithm for Assignment Problem

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.

Download Full-text

Hungarian-Puzzled Text with Dynamic Quadratic Embedding Steganography

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v7i2.pp799-809 ◽

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.

Download Full-text

Improvement in Hungarian Algorithm for Assignment Problem

Advances in Intelligent Systems and Computing - Artificial Intelligence and Evolutionary Algorithms in Engineering Systems ◽

10.1007/978-81-322-2126-5_1 ◽

2014 ◽

pp. 1-8 ◽

Cited By ~ 2

Author(s):

Kartik Shah ◽

Praveenkumar Reddy ◽

S. Vairamuthu

Keyword(s):

Assignment Problem ◽

Hungarian Algorithm

Download Full-text

A Fast Dynamic Assignment Algorithm for Solving Resource Allocation Problems

Jurnal Online Informatika ◽

10.15575/join.v6i1.692 ◽

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.

Download Full-text

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

International Journal of Operations Research and Information Systems ◽

10.4018/joris.2012070106 ◽

2012 ◽

Vol 3 (3) ◽

pp. 87-97 ◽

Cited By ~ 4

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.

Download Full-text