Sparsity pattern

disctom

Namedisctom
Downloaddisctom.mps.gz
Solutiondisctom.sol.gz
OrginatorSven de Vries
FormulatorSven de Vries
DonatorSven de Vries
Rows399
Cols10000
Non-zeros30000
Integers
Binaries10000
Continuous
|Min|1.00000000e+00
|Max|1.00000000e+00
Integer Objective-5000.0
LP Objective-5000.0
Root LP Basisdisctom.bas.gz
Set partitioning6
Set packing
Set covering
Cardinality393
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds
Mixed 0/1
General Cons.
References GritzmannVries2003

The problem instance originates from discrete tomography. The problem is to find a 0/1-matrix such that the number of ones in the single rows, columns, and diagonals are equal to given constant numbers.


Last Update : 2010/06/09 13:56:10 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint