Sparsity pattern

t1722

Namet1722
Downloadt1722.mps.gz
Set Membership Challenge
Problem StatusOpen
Problem FeasibilityFeasible
Originator/ContributorR. Borndörfer
Rows338
Cols36630
Num. non-zeros in A133096
Num. non-zeros in c36630
Rows/Cols0.00922740922741
Integers
Binaries36630
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|948
max |cj|4032
Integer ObjectiveUnknown
LP Objective98815.407611
Aggregation
Variable Bound
Set partitioning338
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References Borndoerfer1998 BorndoerferGroetschelKlostermeierKuettner1999

Vehicle scheduling set partitioning problem from Berlin's Telebus handicapped people's transportation system


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