Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an \(n \times m, m \ge n\) benefit matrix \(B = (b_{ij})\), matching each row to a different column so that the sum of entries at the row-column intersections is maximised.  describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version (\(n \ne m\)) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment beten two proteins, normally of different numbers of amino acids, needs to be maximised.
['Peter R. Brown', 'Yuedong Yang', 'Yaoqi Zhou', 'Wayne John Pullan']
I am writing a research paper on a idea A heuristic for the time constrained asymmetric linear sum assignment problem
[{"from": "human", "value": "I am writing a research paper on a idea A heuristic for the time constrained asymmetric linear sum assignment problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an \\(n \\times m, m \\ge n\\) benefit matrix \\(B = (b_{ij})\\), matching each row to a different column so that the sum of entries at the row-column intersections is maximised.  describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version (\\(n \\ne m\\)) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment beten two proteins, normally of different numbers of amino acids, needs to be maximised."}]