ScholarLens Back to search
2014•Unpublished venueRequires access

A MODIFIED APPROACH FOR ASSIGNMENT METHOD

S. P. Arjun Ram, Murti Smarak

Open publisher page 7 citations

Abstract

The Assignment Problem is one of the most-studied, well known and important problems in Mathematics. It is one of the fundamental Combinatorial Optimization Problem in the field of Optimization or Operations Research in Mathematics. It is a particular case of Transportation Problem where the objective is to assign the resources to the activities so as to minimize total cost or maximize total profit of allocation. In this paper we proposed Modified Assignment Approach for solution of Assignment problem. The algorithm of this approach is presented, and explained briefly with numerical instance to show its efficiency. Also its comparison with Hungarian Algorithm is shown.

About this research paper

What this paper is about

The Assignment Problem is one of the most-studied, well known and important problems in Mathematics. It is one of the fundamental Combinatorial Optimization Problem in the field of Optimization or Operations Research in Mathematics. It is a particular case of Transportation Problem where the objective is to assign the resources to the activities so as to minimize total cost or maximize total profit of allocation. In this paper we proposed Modified Assignment Approach for solution of Assignment problem. The algorithm of this approach is presented, and explained briefly with numerical instance to show its efficiency. Also its comparison with Hungarian Algorithm is shown.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Assignment Problem is one of the most-studied, well known and important problems in Mathematics. It is one of the fundamental Combinatorial Optimization Problem in the field of Optimization or Operations Research in Mathematics. It is a particular case of Transportation Problem where the objective is to assign the resources to the activities so as to minimize total cost or maximize total profit of allocation. In this paper we proposed Modified Assignment Approach for solution of Assignment problem. The algorithm of this approach is presented, and explained briefly with numerical instance to show its efficiency. Also its comparison with Hungarian Algorithm is shown.

Key concepts: Generalized assignment problem, Weapon target assignment problem, Assignment problem, Quadratic assignment problem, Mathematical optimization, Linear bottleneck assignment problem, Optimization problem, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A MODIFIED APPROACH FOR ASSIGNMENT METHOD — Research Paper | ScholarLens