vpphard

binary decomposition benchmark_suitable set_partitioning cardinality invariant_knapsack

Submitter Variables Constraints Density Status Group Objective MPS File
C. Cardonha 51471 47280 1.52989e-04 easy 5 vpphard.mps.gz

Vehicle positioning problem instance

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 51471 43396
Constraints 47280 39326
Binaries 51471 43396
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000152989 0.000199557
Nonzeroes 372305 340562
Constraint Classification Properties
Original Presolved
Total 47280 39326
Empty 199 0
Free 0 0
Singleton 5912 0
Aggregations 0 0
Precedence 1237 0
Variable Bound 0 0
Set Partitioning 320 320
Set Packing 0 0
Set Covering 0 0
Cardinality 326 285
Invariant Knapsack 39286 38721
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
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.579784
Constraint % 0.0713212 2.66567 3.34446 5.61400
Variable % 0.0783482 2.70239 3.41506 5.63646
Score 0.948615

Best Known Solution(s)

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

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
2 5 5 0 0 0 - 2018-10-10 Solution found during MIPLIB2017 problem selection.
1 5 5 0 0 0 - 2018-10-10 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to vpphard 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
vpphard2 easy 199999 199999 0 0 198450 648340 C. Cardonha 81 binary decomposition benchmark_suitable set_partitioning cardinality invariant_knapsack
tanglegram6 easy 9182 9182 0 0 17712 53136 Falk Hueffner huefner 1224 binary benchmark_suitable set_covering invariant_knapsack
tanglegram4 easy 56048 56048 0 0 110404 331212 Falk Hueffner huefner 10696 binary benchmark_suitable set_covering invariant_knapsack
toll-like easy 2883 2883 0 0 4408 13224 Falk Hueffner huefner 610 binary benchmark_suitable set_covering invariant_knapsack
neos-950242 easy 5760 5520 240 0 34224 104160 NEOS Server Submission neos-pseudoapplication-72 4 benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_covering invariant_knapsack general_linear

Reference

No bibliographic information available

Last Update Aug 28, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint