{"id":5880,"identifier":"FK2/5IKK7K","persistentUrl":"https://doi.org/10.60507/FK2/5IKK7K","protocol":"doi","authority":"10.60507","separator":"/","publisher":"bonndata","publicationDate":"2024-09-20","storageIdentifier":"file://10.60507/FK2/5IKK7K","metadataLanguage":"en","datasetType":"dataset","datasetVersion":{"id":265,"datasetId":5880,"datasetPersistentId":"doi:10.60507/FK2/5IKK7K","storageIdentifier":"file://10.60507/FK2/5IKK7K","versionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","latestVersionPublishingState":"RELEASED","deaccessionLink":"","lastUpdateTime":"2024-09-20T10:14:06Z","releaseTime":"2024-09-20T10:14:06Z","createTime":"2024-09-13T11:36:44Z","publicationDate":"2024-09-20","citationDate":"2024-09-20","license":{"name":"CC BY-NC 4.0","uri":"http://creativecommons.org/licenses/by-nc/4.0","iconUri":"https://licensebuttons.net/l/by-nc/4.0/88x31.png"},"fileAccessRequest":false,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","name":"citation","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Large Benchmarks for the Minimum-Cost Flow Problem"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"University of Bonn"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0003-2188-1559","expandedvalue":{"personName":"Held, Stephan","@id":"https://orcid.org/0000-0003-2188-1559","scheme":"ORCID","@type":"https://schema.org/Person"}}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"University of Bonn"},"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"held@dm.uni-bonn.de"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"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"},"dsDescriptionDate":{"typeName":"dsDescriptionDate","multiple":false,"typeClass":"primitive","value":"2023-09-13"}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Mathematical Sciences"]},{"typeName":"freeKeyword","multiple":true,"typeClass":"compound","value":[{"freeKeywordValue":{"typeName":"freeKeywordValue","multiple":false,"typeClass":"primitive","value":"minimum-cost flow, placement legalization, time-cost tradeoff"}}]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationIDType":{"typeName":"publicationIDType","multiple":false,"typeClass":"controlledVocabulary","value":"doi"}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2024-09-13"},{"typeName":"kindOfData","multiple":true,"typeClass":"primitive","value":["DIMACS benchmark format"]}]}},"files":[{"description":"Archive with benchmark data. It contains a readme and license information.","label":"BonnMCFInstances.tar.bz2","restricted":false,"version":1,"datasetVersionId":265,"dataFile":{"id":5881,"persistentId":"doi:10.60507/FK2/5IKK7K/IFIMGJ","pidURL":"https://doi.org/10.60507/FK2/5IKK7K/IFIMGJ","filename":"BonnMCFInstances.tar.bz2","contentType":"application/x-bzip2","friendlyType":"Bzip Archive","filesize":326298882,"description":"Archive with benchmark data. It contains a readme and license information.","storageIdentifier":"file://191eb2b0b0b-8965ea40fc8b","rootDataFileId":-1,"md5":"f91e67456049615ff003b1ffe7f85159","checksum":{"type":"MD5","value":"f91e67456049615ff003b1ffe7f85159"},"tabularData":false,"creationDate":"2024-09-13","publicationDate":"2024-09-20","fileAccessRequest":false}}],"citation":"Held, Stephan, 2024, \"Large Benchmarks for the Minimum-Cost Flow Problem\", https://doi.org/10.60507/FK2/5IKK7K, bonndata, V1"}}