ramos3

binary set_covering

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
F. Ramos	2187	2187	6.85871e-03	open	–	186.0*	ramos3.mps.gz

Set covering problem from a product manufacturing application Imported from MIPLIB2010.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	2187	2187
Constraints	2187	2187
Binaries	2187	2187
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00685871	0.00685871
Nonzeroes	32805	32805

Constraint Classification Properties
	Original	Presolved
Total	2187	2187
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	2187
Cardinality	0	0
Invariant Knapsack	2187	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.

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.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	Submitter	Date	Description
4	186	186	Yuya Hattori	2022-10-13	Computed with weighting local search with exploiting variable associations (WLS) ([1]) [1] Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” European Journal of Operational Research 263.1 (2017): 72-81.
3	192	192	Shunsuke Kamiya	2020-05-17	Computed with weighting local search with exploiting variable associations (WLS) ([1]) [1] Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” European Journal of Operational Research 263.1 (2017): 72-81.
2	195	195	Ed Klotz	2019-01-28
1	220	220	-	2018-10-12	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to ramos3 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	Constraints	Nonz.	Submitter	Group	Objective	Tags
seymour	easy	1372	1372	4944	33549	W. Cook, P. Seymour	–	423	benchmark binary benchmark_suitable variable_bound set_covering
iis-glass-cov	easy	214	214	5375	56133	Marc Pfetsch	iis	20.99999999999999	binary benchmark_suitable set_covering
glass-sc	easy	214	214	6119	63918	Marc Pfetsch	maxfeassub	23	benchmark binary benchmark_suitable set_covering
ex1010-pi	open	25200	25200	1468	102114	M. Winkler	–	233.0*	binary set_covering
iis-hc-cov	easy	297	297	9727	142971	Marc Pfetsch	iis	17	binary benchmark_suitable set_covering

Reference

No bibliographic information available