<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-06T18:14:33Z</responseDate>
  <request identifier="oai:figshare.com:article/33466264" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/33466264</identifier>
        <datestamp>2026-09-11T23:13:34Z</datestamp>
        <setSpec>category_36524</setSpec>
        <setSpec>category_36569</setSpec>
        <setSpec>portal_827</setSpec>
        <setSpec>item_type_3</setSpec>
        <setSpec>month_year_09_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Numerical results of the B&amp;B algorithm experiments</dc:title>
          <dc:creator>Vishmi Fernando (18303538)</dc:creator>
          <dc:creator>Melih Ozlen (18031048)</dc:creator>
          <dc:creator>Sona Taheri (18032500)</dc:creator>
          <dc:subject>Operations research</dc:subject>
          <dc:subject>Optimisation</dc:subject>
          <dc:subject>branch and bound</dc:subject>
          <dc:subject>routing</dc:subject>
          <dc:subject>scheduling</dc:subject>
          <dc:subject>chemotherapy infusions</dc:subject>
          <dc:subject>multi-period</dc:subject>
          <dc:subject>multi-visit</dc:subject>
          <dc:description>&lt;p dir="ltr"&gt;The results obtained from the computational experiments of the proposed branch and bound algorithm are presented.&lt;/p&gt;&lt;p dir="ltr"&gt;There are two sets of results: B&amp;B algorithm (solved without a time limit until the entire tree was explored) and B&amp;B algorithm with a 10 minute time limit.&lt;/p&gt;&lt;p dir="ltr"&gt;The data used is found here. https://doi.org/10.25439/rmt.26325706&lt;/p&gt;</dc:description>
          <dc:date>2026-09-11T23:13:34Z</dc:date>
          <dc:type>Dataset</dc:type>
          <dc:type>Dataset</dc:type>
          <dc:identifier>10.25439/rmt.33466264.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/dataset/Numerical_results_of_the_B_B_algorithm_experiments/33466264</dc:relation>
          <dc:rights>CC BY 4.0</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
