Large Benchmarks for the Minimum-Cost Flow Problemdoi:10.60507/FK2/5IKK7Kbonndata2024-09-201Held, Stephan, 2024, "Large Benchmarks for the Minimum-Cost Flow Problem", https://doi.org/10.60507/FK2/5IKK7K, bonndata, V1Large Benchmarks for the Minimum-Cost Flow Problemdoi:10.60507/FK2/5IKK7KHeld, StephanbonndataHeld, StephanHeld, Stephan2024-09-13Mathematical SciencesMinimum 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.texDIMACS benchmark format<a href="http://creativecommons.org/licenses/by-nc/4.0">CC BY-NC 4.0</a>BonnMCFInstances.tar.bz2Archive with benchmark data. It contains a readme and license information.application/x-bzip2