Sparsity pattern

triptim3

Nametriptim3
Downloadtriptim3.mps.gz
Solutiontriptim3.sol.gz
Set Membership Challenge Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorR. Borndörfer
Rows14939
Cols28440
Num. non-zeros in A524124
Num. non-zeros in c1
Rows/Cols0.525281293952
Integers6812
Binaries21621
Continuous7
min nonzero |Aij|0.0001
max |Aij|4096
min nonzero |cj|1
max |cj|1
Integer Objective13.5311
LP Objective13.511741
Aggregation14
Variable Bound7
Set partitioning63
Set packing1960
Set covering3884
Cardinality2200
Equality Knapsacks
Bin packing
Invariant Knapsack3889
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.6803
References BorndoerferLiebchen2008

Trip timetable optimization problem. First solved by ParaSCIP on a supercomputer with 864 cores in 9.5 hours (November 2015).


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint