Submitter Variables Constraints Density Status Group Objective MPS File
J. Linderoth 65832 100 1.4573e-01 easy eil 880.920108 eilA101-2.mps.gz

Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 65832 65832
Constraints 100 100
Binaries 65832 65832
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.14573 0.14573
Nonzeroes 959373 959373
Constraint Classification Properties
Original Presolved
Total 100 100
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 100 100
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 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 0.30103
Constraint % 100 100 100 100
Variable % 100 100 100 100
Score 0.00000

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
3 1 880.9201 803.3739 0 0 0 - 2018-10-12 Solution imported from MIPLIB2010.
1 3 880.9201 803.3739 0 0 0 - 2018-10-29 Solution found during MIPLIB2017 problem selection.
2 2 880.9201 803.3739 0 0 0 - 2018-10-12 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to eilA101-2 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 Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Status Objective
eilC76-2 28599 28599 0 0 75 314837 J. Linderoth eil easy 762.514781999996
nw04 87482 87482 0 0 36 636666 MIPLIB submission pool easy 16862
ivu06 787239 787239 0 0 1177 8032300 S. Weider ivu open 162.801000588*
ds-big 174997 174997 0 0 1042 4623440 Steffen Weider open 325.09366427*
ivu06-big 2277736 2277736 0 0 1177 23125800 S. Weider ivu open 168.641000869*

Reference

@article{LinderothLeeSavelsbergh2001,
 author = {J. T. Linderoth and E. K. Lee and M. W. P. Savelsbergh},
 journal = {{INFORMS} Journal on Computing},
 pages = {191-209},
 title = {A Parallel, Linear Programming Based Heuristic for
Large Scale Set Partitioning Problems},
 volume = {13},
 year = {2001}
}

@misc{tsplib,
 key = {zzz tsplib},
 note = {http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/},
 title = {TSPLIB},
 year = {2008}
}

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