allcolor10

decomposition aggregations precedence variable_bound set_partitioning integer_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Domenico Salvagnin 14872 34014 1.76208e-04 open allcolor 159* allcolor10.mps.gz

Prepack optimization instance.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 14872 9330
Constraints 34014 23870
Binaries 476 4466
Integers 13776 4784
Continuous 620 80
Implicit Integers 0 304
Fixed Variables 200 0
Nonzero Density 0.000176208 0.000264635
Nonzeroes 89136 58936
Constraint Classification Properties
Original Presolved
Total 34014 23953
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 1134
Precedence 10080 5278
Variable Bound 10080 10080
Set Partitioning 14 95
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 83
Mixed Binary 146 0
General Linear 13694 7283
Indicator 0 0

Structure

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

value min median mean max
Components 1.322219
Constraint % 0.004190 4.95727 7.08002 7.08002
Variable % 0.235798 4.94641 6.95606 6.95606
Score 0.922504

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

Similar instances in collection

The following instances are most similar to allcolor10 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
allcolor58 open 84376 2492 78288 3596 197154 515184 Domenico Salvagnin allcolor 3378* decomposition aggregations precedence variable_bound set_partitioning integer_knapsack general_linear
neos-4165869-wannon hard 31728 480 31248 0 85865 270474 Hans Mittelmann neos-pseudoapplication-44 293 precedence variable_bound set_partitioning set_packing invariant_knapsack integer_knapsack general_linear
neos-4532248-waihi easy 86842 86841 0 1 167322 525339 Jeff Linderoth neos-pseudoapplication-6 61.6 benchmark benchmark_suitable aggregations precedence set_partitioning cardinality binpacking knapsack mixed_binary
csched010 easy 1758 1457 0 301 351 6376 Tallys Yunes csched 407.999999999994 benchmark_suitable aggregations variable_bound set_partitioning general_linear
uccase8 easy 37413 9576 0 27837 53709 214625 Daniel Espinoza uccase 11167.74532 benchmark_suitable aggregations variable_bound set_partitioning invariant_knapsack binpacking knapsack mixed_binary

Reference

@article{FMS16,
    Author = {Matteo Fischetti and Michele Monaci and Domenico Salvagnin},
    Journal = {Discrete Optimization},
    Pages = {195--205},
    Title = {Mixed-Integer Linear Programming Heuristics for the PrePack Optimization Problem},
    Volume = {22},
    Year = {2016}}

@incollection{HMMMMR14,
    Author = {Hoskins, M. and R. Masson and G.G. Melanon and J.E. Mendoza and C. Meyer and L.-M. Rousseau},
    Booktitle = {Integration of AI and OR Techniques in Constraint Programming},
    Editor = {Simonis, H.},
    Pages = {136--143},
    Publisher = {Springer Berlin / Heidelberg},
    Series = {Lecture Notes in Computer Science},
    Title = {The {P}re{P}ack {O}ptimization {P}roblem},
    Volume = {8451},
    Year = 2014}

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