{"dcterms:modified":"2025-07-23","dcterms:creator":"bonndata","@type":"ore:ResourceMap","schema:additionalType":"Dataverse OREMap Format v1.0.1","dvcore:generatedBy":{"@type":"schema:SoftwareApplication","schema:name":"Dataverse","schema:version":"6.6 build 1829-192cdc4","schema:url":"https://github.com/iqss/dataverse"},"@id":"https://bonndata.uni-bonn.de/catalog/datasets/10.60507/FK2/5IKK7K/exportformat/oai-ore.json","ore:describes":{"citation:dsDescription":{"citation:dsDescriptionValue":"Minimum cost flow instance generated at the Research Institute for\nDiscrete Mathematics, University of Bonn.\n\nContact: Stephan Held (held@dm.uni-bonn.de)\n\nThese instances arise in VLSI placement legalization (LEGALIZATION\nsubdir) or as linear relaxation of the discrete time-cost tradeoff\nproblem used for voltage threshold assignment (TCT subdir).\n\nThe LEGALIZATION instances are significantly harder to solve than the\nTCT instances.\n\nAll instances are provided in the DIMACS networks format that is specified here:\nhttp://archive.dimacs.rutgers.edu/Challenges/\nhttp://archive.dimacs.rutgers.edu/pub/netflow/general-info/specs.tex","citation:dsDescriptionDate":"2023-09-13"},"citation:freeKeyword":{"citation:freeKeywordValue":"minimum-cost flow, placement legalization, time-cost tradeoff"},"publication":{"publicationIDType":"doi"},"author":{"citation:authorName":"Held, Stephan","citation:authorAffiliation":"University of Bonn","authorIdentifierScheme":"ORCID","authorIdentifier":{"personName":"Held, Stephan","@id":"https://orcid.org/0000-0003-2188-1559","scheme":"ORCID","@type":"https://schema.org/Person"}},"citation:datasetContact":{"citation:datasetContactName":"Held, Stephan","citation:datasetContactAffiliation":"University of Bonn","citation:datasetContactEmail":"held@dm.uni-bonn.de"},"subject":"Mathematical Sciences","dateOfDeposit":"2024-09-13","citation:depositor":"Held, Stephan","kindOfData":"DIMACS benchmark format","title":"Large Benchmarks for the Minimum-Cost Flow Problem","@id":"https://doi.org/10.60507/FK2/5IKK7K","@type":["ore:Aggregation","schema:Dataset"],"schema:version":"1.0","schema:name":"Large Benchmarks for the Minimum-Cost Flow Problem","schema:dateModified":"Fri Sep 20 12:14:06 CEST 2024","schema:datePublished":"2024-09-20","schema:creativeWorkStatus":"RELEASED","schema:license":"http://creativecommons.org/licenses/by-nc/4.0","dvcore:fileTermsOfAccess":{"dvcore:fileRequestAccess":false},"schema:includedInDataCatalog":"bonndata","schema:isPartOf":{"schema:name":"Bonn Mathematics","@id":"https://bonndata.uni-bonn.de/dataverse/math","schema:description":"Research data from all areas of <a href=\"https://www.mathematics.uni-bonn.de/en\">Bonn mathematics</a>.\n","schema:isPartOf":{"schema:name":"bonndata","@id":"https://bonndata.uni-bonn.de/dataverse/bonndata-root","schema:description":"<h3>bonndata is the institutional, cross-disciplinary research data repository for the publication of research data for all researchers at the University of Bonn.\n<br> bonndata is provided by the <a href=\"https://www.hrz.uni-bonn.de/de\">University IT and Data Center </a> and maintained by the <a href=\"https://www.forschungsdaten.uni-bonn.de/de\">Research Data Service Center</a>.\n<br><hr>\nReady to get started with bonndata? \n<br>\nHave a look at our <a href=\"https://confluence.team.uni-bonn.de/x/-1dqBg\">User Guide</a> to get to know the bonndata workflow, tips and tricks!\n<br><hr>\nQuestions? Need assistance? \n<br>\nGet in touch: <b> researchdata@uni-bonn.de</h3>\n<br><hr>"}},"schema:inLanguage":"en","ore:aggregates":[{"schema:description":"Archive with benchmark data. It contains a readme and license information.","schema:name":"BonnMCFInstances.tar.bz2","dvcore:restricted":false,"schema:version":1,"dvcore:datasetVersionId":265,"@id":"doi:10.60507/FK2/5IKK7K/IFIMGJ","schema:sameAs":"https://bonndata.uni-bonn.de/catalog/downloads/5881/BonnMCFInstances.tar.bz2","@type":"ore:AggregatedResource","schema:fileFormat":"application/x-bzip2","dvcore:filesize":326298882,"dvcore:storageIdentifier":"file://191eb2b0b0b-8965ea40fc8b","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"f91e67456049615ff003b1ffe7f85159"}}],"schema:hasPart":["doi:10.60507/FK2/5IKK7K/IFIMGJ"]},"@context":{"author":"http://purl.org/dc/terms/creator","authorIdentifier":"http://purl.org/spar/datacite/AgentIdentifier","authorIdentifierScheme":"http://purl.org/spar/datacite/AgentIdentifierScheme","citation":"https://dataverse.org/schema/citation/","dateOfDeposit":"http://purl.org/dc/terms/dateSubmitted","dcterms":"http://purl.org/dc/terms/","dvcore":"https://dataverse.org/schema/core#","kindOfData":"http://rdf-vocabulary.ddialliance.org/discovery#kindOfData","ore":"http://www.openarchives.org/ore/terms/","personName":"https://schema.org/name","publication":"http://purl.org/dc/terms/isReferencedBy","publicationIDType":"http://purl.org/spar/datacite/ResourceIdentifierScheme","schema":"http://schema.org/","scheme":"http://www.w3.org/2004/02/skos/core#inScheme","subject":"http://purl.org/dc/terms/subject","title":"http://purl.org/dc/terms/title"}}