bab1

binary decomposition aggregations set_packing set_covering cardinality invariant_knapsack knapsack mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Elmar Swarat, Laura Traverso, Julia Buwaya 61152 60680 2.30251e-04 hard bab -218764.88525 bab1.mps.gz

Integrated vehicle routing and crew scheduling of toll inspectors on German highways Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 61152 9872
Constraints 60680 20450
Binaries 61152 9872
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000230251 0.001035040
Nonzeroes 854392 208956
Constraint Classification Properties
Original Presolved
Total 60680 20450
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 46592 8416
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 12138 11052
Set Covering 52 52
Cardinality 588 532
Invariant Knapsack 1264 369
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 3 8
Integer Knapsack 0 0
Mixed Binary 43 21
General Linear 0 0
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 1.113943
Constraint % 1.30526 8.30255 7.26512 27.8907
Variable % 1.78282 8.33333 9.07618 19.2869
Score 0.873878

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion
ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
2 -218764.9 0 0 0 Hans Mittelmann 2019-12-23 Solved with Gurobi 9.0 using 40 Threads within 12 hours
1 -218764.9 -218764.9 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to bab1 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
mzzv42z easy 11717 11482 235 0 10460 151261 MIPLIB submission pool -20540 benchmark benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality general_linear
mzzv11 easy 10240 9989 251 0 9499 134603 S. Lukac -21718 benchmark benchmark_suitable variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack general_linear
neos-933966 easy 31762 27982 0 3780 12047 180618 NEOS Server Submission neos-pseudoapplication-34 318 benchmark benchmark_suitable precedence variable_bound set_packing invariant_knapsack mixed_binary
cap6000 easy 6000 6000 0 0 2176 48243 MIPLIB submission pool -2451377 binary decomposition aggregations precedence variable_bound set_partitioning set_packing knapsack
nursesched-sprint02 easy 10250 10230 20 0 3522 204000 Haroldo Gambini Santos nursescheduling 57.99999999999999 benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear

Reference

No bibliographic information available

Last Update 2024 by Julian Manns
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint