← Search

Data · dataset · 2024

Large Benchmarks for the Minimum-Cost Flow Problem

Listed in bonndata

Minimum cost flow instance generated at the Research Institute for Discrete Mathematics, University of Bonn.

Description

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: archive.dimacs.rutgers.edu/Challenges/ archive.dimacs.rutgers.edu/pub/netflow/general-info/specs.tex

Links

Where it is published

Catalogue records · 1

Topics

Stated by source
Mathematical Sciences
Provenance · 1 source records, 9 field assertions
SourceKeyLast seenRaw
bonndatadoi:10.60507/FK2/5IKK7K13 d agoJSON v1
FieldAssertionExtractorEvidence
concepts[field].anzsrc:group:4903enrichment · bonndata uni bonn detaxonomy-embedding@1.1.0title+keywords+description (70%)
concepts[field].dataverse_subject:mathematical-sciencessource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/subjects
concepts[field].local:field:mathematics-statisticsmapping · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/subjects
created_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
descriptionsource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/description
publication_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
titlesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/name
updated_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
version_labelsource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0