|
View: |
Part 1: Document Description
|
|
Citation |
|
|---|---|
|
Title: |
Large Benchmarks for the Minimum-Cost Flow Problem |
|
Identification Number: |
doi:10.60507/FK2/5IKK7K |
|
Distributor: |
bonndata |
|
Date of Distribution: |
2024-09-20 |
|
Version: |
1 |
|
Bibliographic Citation: |
Held, Stephan, 2024, "Large Benchmarks for the Minimum-Cost Flow Problem", https://doi.org/10.60507/FK2/5IKK7K, bonndata, V1 |
|
Citation |
|
|
Title: |
Large Benchmarks for the Minimum-Cost Flow Problem |
|
Identification Number: |
doi:10.60507/FK2/5IKK7K |
|
Authoring Entity: |
Held, Stephan (University of Bonn) |
|
Distributor: |
bonndata |
|
Access Authority: |
Held, Stephan |
|
Depositor: |
Held, Stephan |
|
Date of Deposit: |
2024-09-13 |
|
Holdings Information: |
https://doi.org/10.60507/FK2/5IKK7K |
|
Study Scope |
|
|
Keywords: |
Mathematical Sciences |
|
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 |
|
Kind of Data: |
DIMACS benchmark format |
|
Methodology and Processing |
|
|
Sources Statement |
|
|
Data Access |
|
|
Other Study Description Materials |
|
|
Label: |
BonnMCFInstances.tar.bz2 |
|
Text: |
Archive with benchmark data. It contains a readme and license information. |
|
Notes: |
application/x-bzip2 |