Sparsity pattern

triptim1

Nametriptim1
Downloadtriptim1.mps.gz
Solutiontriptim1.sol.gz
Set Membership Benchmark Primal
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorR. Borndörfer
Rows15706
Cols30055
Num. non-zeros in A515436
Num. non-zeros in c1
Rows/Cols0.522575278656
Integers9597
Binaries20451
Continuous7
min nonzero |Aij|0.0001
max |Aij|6329
min nonzero |cj|1
max |cj|1
Integer Objective22.8681
LP Objective22.868088
Aggregation14
Variable Bound7
Set partitioning
Set packing2049
Set covering4038
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack4043
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.9590
References BorndoerferLiebchen2008

Trip timetable optimization problem


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