Sparsity pattern

eil33-2

Nameeil33-2
Downloadeil33-2.mps.gz
Solutioneil33-2.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorJ. Linderoth
Rows32
Cols4516
Num. non-zeros in A44243
Num. non-zeros in c4516
Rows/Cols0.00708591674048
Integers
Binaries4516
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|68.8767
max |cj|413.2515
Integer Objective934.007916
LP Objective811.278996
Aggregation
Variable Bound
Set partitioning32
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