eil33-2

benchmark binary benchmark_suitable set_partitioning

Submitter Variables Constraints Density Status Group Objective MPS File
J. Linderoth 4516 32 3.06155e-01 easy eil 934.007915999999 eil33-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 4516 4516
Constraints 32 32
Binaries 4516 4516
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.306155 0.306155
Nonzeroes 44243 44243
Constraint Classification Properties
Original Presolved
Total 32 32
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 32 32
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
2 1 934.0079 811.279 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.
1 2 934.0079 811.279 0 0 0 - 2018-10-13 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to eil33-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 Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
eilC76-2 easy 28599 28599 0 0 75 314837 J. Linderoth eil 762.514781999996 binary benchmark_suitable set_partitioning
t1722 open 36630 36630 0 0 338 133096 R. Borndörfer 114245* binary set_partitioning
t1717 open 73885 73885 0 0 551 325689 R. Borndörfer 180966* binary set_partitioning
eilA101-2 easy 65832 65832 0 0 100 959373 J. Linderoth eil 880.920108 benchmark binary benchmark_suitable set_partitioning
irp easy 20315 20315 0 0 39 98254 MIPLIB submission pool 12159.492835397 benchmark binary benchmark_suitable set_partitioning

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 Okt 02, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint