A Reduced Dimension Optimization Algorithm of Assignment Problem
YE Xi-ning
Abstract
YE Xi-ning
Abstract
In operational research,the assignment problem is a kind of problem of special linear programming.In our life,the assignment problem is universal.In this paper,A Reduced Dimension Optimization Solution of the problem is proposed by analyzing the model of the assignment problem.And the idea of the algorithm is different from that of some others.In addition,the algorithm will provide a new approach for the assignment problem.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In operational research,the assignment problem is a kind of problem of special linear programming.In our life,the assignment problem is universal.In this paper,A Reduced Dimension Optimization Solution of the problem is proposed by analyzing the model of the assignment problem.And the idea of the algorithm is different from that of some others.In addition,the algorithm will provide a new approach for the assignment problem.
Key concepts: Weapon target assignment problem, Generalized assignment problem, Assignment problem, Dimension (graph theory), Mathematical optimization, Optimization problem, Linear bottleneck assignment problem, Quadratic assignment problem