Large Benchmarks for the Minimum-Cost Flow Problem
type: Dataset
creator: Held, Stephan
author: Held, Stephan
date published: 2024-09-20
date modified: 2024-09-20
version: 1
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
keywords: Mathematical Sciences
license: http://creativecommons.org/licenses/by-nc/4.0
included in data catalog: bonndata
publisher: bonndata
provider: bonndata
distribution: BonnMCFInstances.tar.bz2

Held, Stephan
type: Person
given name: Stephan
family name: Held
affiliation: University of Bonn

BonnMCFInstances.tar.bz2
type: DataDownload
encoding format: application/x-bzip2
content size: 326298882
description: Archive with benchmark data. It contains a readme and license information.