Sparsity pattern

eilA101-2

NameeilA101-2
DownloadeilA101-2.mps.gz
SolutioneilA101-2.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorJ. Linderoth
Rows100
Cols65832
Num. non-zeros in A959373
Num. non-zeros in c65832
Rows/Cols0.0015190181067
Integers
Binaries65832
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|8.944272
max |cj|405.1038
Integer Objective880.920108
LP Objective803.373888
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