bonndata catalog
Thumbnail for Large Benchmarks for the Minimum-Cost Flow Problem

Large Benchmarks for the Minimum-Cost Flow Problem

Open this dataset in the live repository

Important usage condition: Use and redistribution are governed by CC BY-NC 4.0. Review and comply with the license before using the data.
Persistent identifier
doi:10.60507/FK2/5IKK7K
Published version
1.0
Publication date
2024-09-20
License
CC BY-NC 4.0

Description

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

Creators

Keywords

minimum-cost flow, placement legalization, time-cost tradeoff

Files

Before downloading: Use and redistribution are governed by CC BY-NC 4.0. Review and comply with the license before using the data.
FileTypeBytesChecksum
BonnMCFInstances.tar.bz2application/x-bzip2326298882MD5 f91e67456049615ff003b1ffe7f85159

Citation

Held, Stephan, 2024-09-20, Large Benchmarks for the Minimum-Cost Flow Problem, doi:10.60507/FK2/5IKK7K, V1.0

Additional Dataverse fields

Id265
Dataset Typedataset
Internal Version Number7
Latest Version Publishing StateRELEASED
Deaccession LinkNot supplied
Release Time2024-09-20T10:14:06Z
Create Time2024-09-13T11:36:44Z
Citation Date2024-09-20
File Access RequestFalse

Export metadata

Static metadata exports available for this published dataset version:

Complete Dataverse metadata

Citation Metadata

Title title
Large Benchmarks for the Minimum-Cost Flow Problem
Author author
  1. Author Name
    Held, Stephan
    Author Affiliation
    University of Bonn
    Author Identifier Scheme
    ORCID
    Author Identifier
    Type Name
    authorIdentifier
    Multiple
    False
    Type Class
    primitive
    Value
    https://orcid.org/0000-0003-2188-1559
    Expandedvalue
    Person Name
    Held, Stephan
    @id
    https://orcid.org/0000-0003-2188-1559
    Scheme
    ORCID
    @type
    https://schema.org/Person
Dataset Contact datasetContact
  1. Dataset Contact Name
    Held, Stephan
    Dataset Contact Affiliation
    University of Bonn
    Dataset Contact Email
    held@dm.uni-bonn.de
Ds Description dsDescription
  1. Ds Description Value
    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
    Ds Description Date
    2023-09-13
Subject subject
  1. Mathematical Sciences
Free Keyword freeKeyword
  1. Free Keyword Value
    minimum-cost flow, placement legalization, time-cost tradeoff
Publication publication
  1. Publication IDType
    doi
Depositor depositor
Held, Stephan
Date Of Deposit dateOfDeposit
2024-09-13
Kind Of Data kindOfData
  1. DIMACS benchmark format

Expected crawler behaviour

Use a stable, truthful User-Agent with product/version and a working contact URL. Across all IP addresses and HTTP connections used by one crawler identity, allow no more than 5 requests in flight and wait at least 20 seconds between request starts. Crawl URLs listed in the catalog sitemap, including file pages and download URLs when they are published, use conditional requests, honor Retry-After, and apply exponential backoff after errors.

The welcome page may link to the interactive repository for human navigation. Automated clients must not treat that human link as a catalog crawl target.

Read the live machine-readable crawler policy before and during a crawl. Stop crawling when it reports CPU or memory utilization at or above 80% and 80% respectively.