Sparsity pattern

triptim2

Nametriptim2
Downloadtriptim2.mps.gz
Solutiontriptim2.sol.gz
Set Membership Challenge Reoptimize
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorR. Borndörfer
Rows14427
Cols27326
Num. non-zeros in A521898
Num. non-zeros in c1
Rows/Cols0.527958720632
Integers6548
Binaries20771
Continuous7
min nonzero |Aij|0.0001
max |Aij|1024
min nonzero |cj|1
max |cj|1
Integer Objective12.0051
LP Objective10.866359
Aggregation14
Variable Bound7
Set partitioning50
Set packing1898
Set covering3784
Cardinality2127
Equality Knapsacks
Bin packing
Invariant Knapsack3789
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.6539
References BorndoerferLiebchen2008

Trip timetable optimization problem. First solved by Gurobi 6.5 (12 threads) in about 13 days (December 2015).


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