n3seq24

binary benchmark_suitable set_packing set_covering invariant_knapsack knapsack

Submitter Variables Constraints Density Status Group Objective MPS File
R. Meirich 119856 6044 4.46203e-03 easy nseq 52200 n3seq24.mps.gz

Static line planning models on the Dutch IC network

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 119856 119856
Constraints 6044 6044
Binaries 119856 119856
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00446203 0.00446203
Nonzeroes 3232340 3232340
Constraint Classification Properties
Original Presolved
Total 6044 6044
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 4484 4484
Set Covering 1112 120
Cardinality 0 0
Invariant Knapsack 0 992
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 448
Integer Knapsack 0 0
Mixed Binary 448 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 3.651762
Constraint % 0.0165453 0.0165453 0.0165453 0.0165453
Variable % 0.0200240 0.0223015 0.0200240 1.9907200
Score 0.741727

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

Similar instances in collection

The following instances are most similar to n3seq24 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
nursesched-medium04 easy 29667 29613 54 0 8668 621829 Haroldo Gambini Santos nursescheduling 237 decomposition benchmark_suitable set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear
nursesched-sprint02 easy 10250 10230 20 0 3522 204000 Haroldo Gambini Santos nursescheduling 58 benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
neos-498623 easy 9861 8500 0 1361 2047 148434 NEOS Server Submission neos-pseudoapplication-5 16.6 benchmark_suitable aggregations variable_bound set_partitioning set_packing mixed_binary general_linear
neos-3216931-puriri easy 3555 3268 0 287 5989 91691 Jeff Linderoth neos-pseudoapplication-56 71320 benchmark benchmark_suitable aggregations variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack binpacking knapsack general_linear
n3div36 easy 22120 22120 0 0 4484 340740 R. Meirich nseq 130800 benchmark binary decomposition benchmark_suitable set_packing set_covering mixed_binary

Reference

@mastersthesis{Meirich2010,
 author = {Robert Meirich},
 school = {Technische {Universit\"at} Berlin},
 title = {Polyedrische {U}ntersuchung eines {L}inienplanungsproblems},
 type = {Diploma thesis},
 year = {2010}
}

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