neos-4797081-pakoka

feasibility benchmark_suitable precedence set_packing cardinality general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Hans Mittelmann 12393 7147 5.14971e-03 easy neos-pseudoapplication-51 0 neos-4797081-pakoka.mps.gz

Collection of anonymous submissions to the NEOS Server for Optimization

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 12393 12369
Constraints 7147 6828
Binaries 9930 9984
Integers 2463 2385
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00514971 0.00539670
Nonzeroes 456124 455781
Constraint Classification Properties
Original Presolved
Total 7147 6828
Empty 0 0
Free 0 0
Singleton 319 0
Aggregations 0 0
Precedence 3252 3252
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 1655 1655
Set Covering 0 0
Cardinality 0 24
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 1921 1897
Indicator 0 0

Structure

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

value min median mean max
Components 3.284882
Constraint % 0.0146585 0.0373463 0.0146585 0.1759010
Variable % 0.0484144 0.0506852 0.0484144 0.0645526
Score 0.718865

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 0 0 0 0 0 - 2018-10-15 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to neos-4797081-pakoka 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
mcsched easy 1747 1745 0 2 2107 8088 Q. Chen 211913 benchmark decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack general_linear
oocsp-racks030f7cci easy 50859 32779 18080 0 92792 233170 Gleb Belov oocsp-racks Infeasible infeasible feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering cardinality invariant_knapsack integer_knapsack general_linear
piperout-d27 easy 13104 12931 149 24 17470 224457 Gleb Belov piperout 8124 decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
triptim4 hard 27226 18537 8682 7 14361 520532 MIPLIB submission pool triptim 9.818099999800323 aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear
triptim2 hard 27326 20776 6543 7 14427 521898 MIPLIB submission pool triptim 12.0051 aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear

Reference

No bibliographic information available

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