ns1631475

decomposition precedence variable_bound set_partitioning cardinality mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
NEOS Server Submission 22696 24496 2.09966e-04 open neos-pseudoapplication-75 13500* ns1631475.mps.gz

Traveling salesman problem model

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 22696 22696
Constraints 24496 24496
Binaries 22470 22470
Integers 211 211
Continuous 15 15
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000209966 0.000209966
Nonzeroes 116733 116733
Constraint Classification Properties
Original Presolved
Total 24496 24496
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 22260 22260
Variable Bound 28 28
Set Partitioning 30 240
Set Packing 0 0
Set Covering 0 0
Cardinality 1785 1575
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 183 183
General Linear 210 210
Indicator 0 0

Structure

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

value min median mean max
Components 2.328380
Constraint % 0.428641 0.432704 0.428641 0.861365
Variable % 0.467043 0.471698 0.467043 0.991364
Score 0.912964

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

Similar instances in collection

The following instances are most similar to ns1631475 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
piperout-d20 easy 11961 11788 149 24 15562 190915 Gleb Belov piperout 29948 decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary 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
neos-631710 easy 167056 167056 0 0 169576 834166 NEOS Server Submission neos-pseudoapplication-75 203 benchmark binary benchmark_suitable precedence set_partitioning set_packing binpacking
neos-4295773-pissa open 85126 85124 0 2 210116 552408 Jeff Linderoth neos-pseudoapplication-6 0.0490931664* decomposition aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack knapsack mixed_binary
comp16-3idx open 64193 56745 14 7434 71594 347276 Matias Sørensen coursetimetabling 50* decomposition aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack mixed_binary general_linear

Reference

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

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