7 Haziran 2022 Veri seti Açık Erişim

Serpil Sayın

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" 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:creator>Serpil Sayın</dc:creator>
  <dc:date>2022-06-07</dc:date>
  <dc:description>This data set contains problem instances for multiobjective knapsack and assignment problems with three objective functions. The data generation scheme builds on the base case  that consists of uncorrelated instances described in http://home.ku.edu.tr/~moolibrary/. Here, the objective function coefficients (knapsack, assignment)  and  constraint coefficients (knapsack)  display certain levels of positive correlation. The details of the data generation scheme used is given in the document description.pdf.  

Knapsack problem instances  have three objective functions,   25, 50, 75, 100 objects, 4 levels of correlation (10 in each category).

Assignment problem instances  have three objective functions,  5,10,...,50 objects, 4 levels of correlation (10 in each category).</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/228303</dc:identifier>
  <dc:identifier>10.48623/aperta.228303</dc:identifier>
  <dc:identifier>oai:aperta.ulakbim.gov.tr:228303</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>url:https://aperta.ulakbim.gov.tr/deposit/228303</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:subject>discrete multiobjective optimization</dc:subject>
  <dc:subject>assignment problem</dc:subject>
  <dc:subject>correlated data</dc:subject>
  <dc:title>Correlated Instances for Multiobjective Assignment and Knapsack Problems</dc:title>
  <dc:type>info:eu-repo/semantics/other</dc:type>
  <dc:type>dataset</dc:type>
</oai_dc:dc>