Sparsity pattern

eilB101

NameeilB101
DownloadeilB101.mps.gz
SolutioneilB101.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorJ. Linderoth
Rows100
Cols2818
Num. non-zeros in A24120
Num. non-zeros in c2818
Rows/Cols0.0354861603974
Integers
Binaries2818
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|8.944272
max |cj|335.9627
Integer Objective1216.920174
LP Objective1075.247691
Aggregation
Variable Bound
Set partitioning100
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References LinderothLeeSavelsbergh2001 tsplib

Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB


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