<?xml version="1.0" encoding="UTF-8"?>
<resource xmlns="http://datacite.org/schema/kernel-4" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.5/metadata.xsd">
  <identifier identifierType="DOI">10.60507/FK2/5IKK7K</identifier>
  <creators>
    <creator>
      <creatorName nameType="Personal">Held, Stephan</creatorName>
      <givenName>Stephan</givenName>
      <familyName>Held</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="https://orcid.org">https://orcid.org/0000-0003-2188-1559</nameIdentifier>
      <affiliation>University of Bonn</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Large Benchmarks for the Minimum-Cost Flow Problem</title>
  </titles>
  <publisher>bonndata</publisher>
  <publicationYear>2024</publicationYear>
  <subjects>
    <subject>Mathematical Sciences</subject>
  </subjects>
  <contributors>
    <contributor contributorType="ContactPerson">
      <contributorName nameType="Personal">Held, Stephan</contributorName>
      <givenName>Stephan</givenName>
      <familyName>Held</familyName>
      <affiliation>University of Bonn</affiliation>
    </contributor>
  </contributors>
  <dates>
    <date dateType="Submitted">2024-09-13</date>
    <date dateType="Available">2024-09-20</date>
  </dates>
  <resourceType resourceTypeGeneral="Dataset">DIMACS benchmark format</resourceType>
  <relatedIdentifiers>
    <relatedIdentifier relationType="HasPart" relatedIdentifierType="DOI">10.60507/FK2/5IKK7K/IFIMGJ</relatedIdentifier>
  </relatedIdentifiers>
  <sizes>
    <size>326298882</size>
  </sizes>
  <formats>
    <format>application/x-bzip2</format>
  </formats>
  <version>1.0</version>
  <rightsList>
    <rights rightsURI="info:eu-repo/semantics/openAccess"/>
    <rights rightsURI="http://creativecommons.org/licenses/by-nc/4.0" xml:lang="en">Creative Commons Attribution-NonCommercial 4.0 International License.</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">Minimum cost flow instance generated at the Research Institute for
Discrete Mathematics, University of Bonn.

Contact: Stephan Held (held@dm.uni-bonn.de)

These instances arise in VLSI placement legalization (LEGALIZATION
subdir) or as linear relaxation of the discrete time-cost tradeoff
problem used for voltage threshold assignment (TCT subdir).

The LEGALIZATION instances are significantly harder to solve than the
TCT instances.

All instances are provided in the DIMACS networks format that is specified here:
http://archive.dimacs.rutgers.edu/Challenges/
http://archive.dimacs.rutgers.edu/pub/netflow/general-info/specs.tex</description>
  </descriptions>
</resource>
