Sparsity pattern

p2m2p1m1p0n100

Namep2m2p1m1p0n100
Downloadp2m2p1m1p0n100.mps.gz
Set Membership Infeasible Tree
Problem StatusEasy
Problem FeasibilityInfeasible
Originator/ContributorB. Krishnamoorthy, G. Pataki
Rows1
Cols100
Num. non-zeros in A100
Num. non-zeros in c100
Rows/Cols0.01
Integers
Binaries100
Continuous
min nonzero |Aij|6562
max |Aij|14354
min nonzero |cj|6562
max |cj|14354
Integer ObjectiveInfeasible
LP Objective80424
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks1
Integer Knapsack
Mixed 0/11
General Cons.
References

A 0-1 knapsack problem constructed to be difficult


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint