aligninq

benchmark_suitable invariant_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 1831 340 2.52739e-02 easy 2713 aligninq.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 1831 1831
Constraints 340 340
Binaries 1830 1830
Integers 0 1
Continuous 1 0
Implicit Integers 0 1
Fixed Variables 0 0
Nonzero Density 0.0252739 0.0252739
Nonzeroes 15734 15734
Constraint Classification Properties
Original Presolved
Total 340 340
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 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 263 263
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 12 0
Integer Knapsack 0 0
Mixed Binary 65 76
General Linear 0 1
Indicator 0 0

Structure

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

value min median mean max
Components 0.4771212
Constraint % 3.529410 38.6765 38.6765 73.8235
Variable % 0.983069 8.3834 8.3834 15.7837
Score 0.6566610

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

Similar instances in collection

The following instances are most similar to aligninq 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
neos-3218348-suir easy 7022 7006 0 16 1320 221881 Jeff Linderoth neos-pseudoapplication-72 Infeasible infeasible decomposition aggregations set_partitioning invariant_knapsack equation_knapsack mixed_binary
nursesched-sprint-late03 easy 11690 11670 20 0 5032 208410 Haroldo Gambini Santos nursescheduling 48 decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
tw-myciel4 hard 760 759 1 0 8146 27961 Arie Koster 10 aggregations precedence variable_bound invariant_knapsack general_linear
nursesched-medium-hint03 hard 34248 34170 78 0 14062 622800 Haroldo Gambini Santos nursescheduling 115 benchmark decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
nursesched-sprint-hidden09 easy 11650 11630 20 0 4872 208050 Haroldo Gambini Santos nursescheduling 338 benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear

Reference

No bibliographic information available

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