splice1k1

benchmark benchmark_suitable set_covering binpacking general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	3253	6505	8.32208e-02	easy	splice	-394	splice1k1.mps.gz

Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don’t know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38. Solved with COPT 7.0 using up to 12 threads in less than 30 minutes.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	3253	3253
Constraints	6505	6505
Binaries	3252	3252
Integers	1	1
Continuous	0	0
Implicit Integers	0	1
Fixed Variables	0	0
Nonzero Density	0.0832208	0.0832208
Nonzeroes	1761020	1761020

Constraint Classification Properties
	Original	Presolved
Total	6505	6505
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	3252
Cardinality	0	0
Invariant Knapsack	60	0
Equation Knapsack	0	0
Bin Packing	3252	3252
Knapsack	3192	0
Integer Knapsack	0	0
Mixed Binary	0	0
General Linear	1	1
Indicator	0	0

Structure

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

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components	0.301030
Constraint %		99.9846	99.9846	99.9846	99.9846
Variable %		99.9693	99.9693	99.9693	99.9693
Score	0.000307

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

Similar instances in collection

The following instances are most similar to splice1k1 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
k1mushroom	easy	8211	8210	1	0	16419	1697946	Gleb Belov	k1mushroom	-3288	benchmark benchmark_suitable set_covering binpacking general_linear
hypothyroid-k1	easy	2602	2601	1	0	5195	433884	Gleb Belov	hypothyroid	-2851	benchmark benchmark_suitable aggregations precedence set_covering binpacking general_linear
neos-2991472-kalu	open	12105	12096	0	9	18170	13709358	Jeff Linderoth	neos-pseudoapplication-77	12*	set_packing set_covering invariant_knapsack binpacking knapsack mixed_binary
supportcase18	easy	13410	13410	0	0	240	28920	Michael Winkler	–	48	benchmark binary benchmark_suitable set_partitioning binpacking
usafa	open	228648	216357	12291	0	1377561	16485102	Christopher Daniel Richards	–	160.1671357657*	aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack binpacking integer_knapsack general_linear

Reference

@Inbook{Belov2016,
author="Belov, Gleb
and Stuckey, Peter J.
and Tack, Guido
and Wallace, Mark",
editor="Rueher, Michel",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
isbn="978-3-319-44953-1",
doi="10.1007/978-3-319-44953-1_4",
url="http://dx.doi.org/10.1007/978-3-319-44953-1_4"
}