neos-631710

benchmark binary benchmark_suitable precedence set_partitioning set_packing binpacking

Submitter Variables Constraints Density Status Group Objective MPS File
NEOS Server Submission 167056 169576 2.9446e-05 easy neos-pseudoapplication-75 203 neos-631710.mps.gz

Instance coming from the NEOS Server with unknown application. Solved with Gurobi 4.6.1 (12 threads) in 1264.7 sec. Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 167056 167056
Constraints 169576 169576
Binaries 167056 167056
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 2.9446e-05 2.9446e-05
Nonzeroes 834166 834166
Constraint Classification Properties
Original Presolved
Total 169576 169576
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 167055 167055
Variable Bound 0 0
Set Partitioning 300 300
Set Packing 1665 1665
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 556 556
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
Constraint %
Variable %
Score

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 203 203 0 0 0 - 2018-10-29 Solution imported from MIPLIB2010.
1 203 203 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to neos-631710 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
supportcase29 easy 12050 12050 0 0 12441 96050 Domenico Salvagnin Infeasible infeasible binary decomposition benchmark_suitable precedence set_packing invariant_knapsack binpacking knapsack mixed_binary
ns1828997 open 27275 27275 0 0 81725 190670 NEOS Server Submission neos-pseudoapplication-13 7.99999999999967* binary precedence variable_bound cardinality invariant_knapsack
stp3d hard 204880 204880 0 0 159488 662128 T. Koch 493.71965 binary decomposition aggregations precedence variable_bound set_partitioning set_packing cardinality
neos-4322846-ryton easy 108700 108699 0 1 104972 452044 Jeff Linderoth neos-pseudoapplication-6 0.41984836 decomposition benchmark_suitable aggregations precedence set_partitioning cardinality binpacking knapsack mixed_binary
neos-4295773-pissa hard 85126 85124 0 2 210116 552408 Jeff Linderoth neos-pseudoapplication-6 0.03830719099856019 decomposition aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack knapsack mixed_binary

Reference

@misc{neos,
 key = {zzz neos},
 note = {http://www.neos-server.org},
 title = {{NEOS} {S}erver for {O}ptimization},
 year = {2011}
}

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