Large Benchmarks for the Minimum-Cost Flow Problem
收藏DataCite Commons2024-10-18 更新2025-04-09 收录
下载链接：
https://bonndata.uni-bonn.de/citation?persistentId=doi:10.60507/FK2/5IKK7K
下载链接
链接失效反馈官方服务：
资源简介：
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
提供机构：
bonndata
创建时间：
2024-09-13
