<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Murty's Algorithm for k-Best Assignments</dc:title>
  <dc:title>R package muRty version 0.3.1</dc:title>
  <dc:description>Calculates k-best solutions and costs for an assignment problem following the method outlined in Murty (1968) &lt;doi:10.1287/opre.16.3.682&gt;.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 3.1.0)</dc:relation>
  <dc:relation>Imports: clue, lpSolve</dc:relation>
  <dc:relation>Suggests: testthat</dc:relation>
  <dc:creator>Aljaz Jelenko &lt;aljaz.jelenko@amis.net&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Aljaz Jelenko [aut, cre]</dc:contributor>
  <dc:rights>MIT + file LICENSE (https://CRAN.R-project.org/package=muRty/LICENSE)</dc:rights>
  <dc:date>2020-02-29</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=muRty</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.muRty</dc:identifier>
</oai_dc:dc>