<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://202.88.229.59:8080/xmlui/handle/123456789/2330">
    <title>DSpace Collection:</title>
    <link>http://202.88.229.59:8080/xmlui/handle/123456789/2330</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://202.88.229.59:8080/xmlui/handle/123456789/2537" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-14T20:03:43Z</dc:date>
  </channel>
  <item rdf:about="http://202.88.229.59:8080/xmlui/handle/123456789/2537">
    <title>New Proposed Method for Solving Assignment Problem and Comparitive Study with the Existing Methods</title>
    <link>http://202.88.229.59:8080/xmlui/handle/123456789/2537</link>
    <description>Title: New Proposed Method for Solving Assignment Problem and Comparitive Study with the Existing Methods
Authors: Asst.Prof.K.S, Sreeja
Abstract: An assignment problem concerns as to what happens to the effectiveness function when we associate each of a number of origins with each of the same number of destinations. Each resources or facility is to be associated with one and only one job and associations are to be made in such a way so as to minimize the total effectiveness. The optimum allocation for balanced assignment problem is discussed here. In this paper, as a method to bring efficiency to solve assignment problems with new technique is formulated. One problem is illustrated using new method and result is compared to Hungarian method.</description>
    <dc:date>2019-11-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

