haprp

decomposition aggregations general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 1828 1048 1.89378e-03 easy 3673280.6808 haprp.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 1828 1640
Constraints 1048 942
Binaries 0 0
Integers 1828 1640
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00189378 0.00212055
Nonzeroes 3628 3276
Constraint Classification Properties
Original Presolved
Total 1048 942
Empty 0 0
Free 0 0
Singleton 4 0
Aggregations 288 248
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 756 694
Indicator 0 0

Structure

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

value min median mean max
Components 1.544068
Constraint % 0.212314 2.84751 3.50318 3.50318
Variable % 0.182927 2.94118 3.65854 3.65854
Score 0.935710

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
1 3673281 3673281 9e-07 5e-07 8.2e-06 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to haprp 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
neos-3083819-nubu easy 8644 0 8644 0 4725 24048 Jeff Linderoth neos-pseudoapplication-31 6307996 benchmark decomposition benchmark_suitable aggregations integer_knapsack general_linear
neos-3024952-loue easy 3255 0 3255 0 3705 17310 Jeff Linderoth neos-pseudoapplication-86 26756 benchmark decomposition benchmark_suitable precedence integer_knapsack general_linear
neos-2657525-crna easy 524 146 378 0 342 1690 Jeff Linderoth neos-pseudoapplication-7 1.810748 benchmark decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning integer_knapsack general_linear
neos-2624317-amur easy 524 180 344 0 342 1690 Jeff Linderoth neos-pseudoapplication-7 3.5223968 decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning integer_knapsack general_linear
neos-2626858-aoos easy 524 209 315 0 342 1690 Jeff Linderoth neos-pseudoapplication-7 Infeasible infeasible decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning integer_knapsack general_linear

Reference

No bibliographic information available

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