<?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>R's Shortest Path Problem with Forbidden Subpaths</dc:title>
  <dc:title>R package rsppfp version 1.0.4</dc:title>
  <dc:description>An implementation of functionalities to transform directed graphs that are bound to a set of
  known forbidden paths. There are several transformations, following the rules provided by Villeneuve 
  and Desaulniers (2005) &lt;doi: 10.1016/j.ejor.2004.01.032&gt;, and Hsu et al. (2009) &lt;doi: 10.1007/978-3-642-03095-6_60&gt;. 
  The resulting graph is generated in a data-frame format. See rsppfp website for more information, 
  documentation an examples.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 3.4.0)</dc:relation>
  <dc:relation>Imports: dplyr, foreach, doParallel, igraph, tidyr, stringr</dc:relation>
  <dc:relation>Suggests: knitr, rmarkdown, testthat, covr, ggplot2</dc:relation>
  <dc:creator>Melina Vidoni &lt;melinavidoni@santafe-conicet.gov.ar&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Melina Vidoni [aut, cre] (ORCID:
    &lt;https://orcid.org/0000-0002-4099-1430&gt;),
  Aldo Vecchietti [aut]</dc:contributor>
  <dc:rights>GPL-3</dc:rights>
  <dc:date>2019-02-19</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=rsppfp</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.rsppfp</dc:identifier>
</oai_dc:dc>
