ns1828997

binary precedence variable_bound cardinality invariant_knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
NEOS Server Submission	27275	81725	8.55387e-05	open	neos-pseudoapplication-13	7.99999999999967*	ns1828997.mps.gz

Instance coming from the NEOS Server with unknown application. Imported from the MIPLIB2010 submissions.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	27275	27250
Constraints	81725	81350
Binaries	27275	27250
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	8.55387e-05	8.56735e-05
Nonzeroes	190670	189920

Constraint Classification Properties
	Original	Presolved
Total	81725	81350
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	54125	53750
Variable Bound	710	710
Set Partitioning	0	0
Set Packing	0	0
Set Covering	0	0
Cardinality	15	15
Invariant Knapsack	26875	26875
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.301030
Constraint %		100.0000	100.0000	100.0000	100.0000
Variable %		99.9083	99.9083	99.9083	99.9083
Score	0.000917

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion

ID	Objective	Exact	Submitter	Date	Description
5	8	8	Gerald Gamrath	2023-03-28	Found with COPT 6.5 in 10h.
4	8	8	Peng Lin, Shaowei Cai, Mengchuan Zou, Jinkun Lin	2023-05-03	Computed by local search based on the paper Peng Lin, Shaowei Cai, Mengchuan Zou, and Jinkun Lin. “New Characterizations and Efficient Local Search for General Integer Linear Programming”, arXiv preprint arXiv:2305.00188 (2023).
3	9		Hans Mittelmann	2019-12-18	found with Gurobi 8.1 using 24 threads after approx. 36 hours of running time
2	16		Robert Ashford and Alkis Vazacopoulus	2019-12-18	Found using ODH\|CPlex
1	20	20	-	2018-10-11	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to ns1828997 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-631710	easy	167056	167056	0	0	169576	834166	NEOS Server Submission	neos-pseudoapplication-75	203	benchmark binary benchmark_suitable precedence set_partitioning set_packing binpacking
ns1904248	open	38458	38416	0	42	149437	377258	NEOS Server Submission	neos-pseudoapplication-6	37.01762611059417*	precedence variable_bound set_covering invariant_knapsack mixed_binary
supportcase10	hard	14770	14770	0	0	165684	555082	Michael Winkler	–	7	benchmark binary benchmark_suitable aggregations precedence variable_bound set_covering invariant_knapsack
fhnw-schedule-pairb200	open	40200	40000	0	200	99554	298554	Simon Felix	schedule	-19.24094384259708*	precedence variable_bound invariant_knapsack mixed_binary
neos-4260495-otere	easy	176048	168745	22	7281	295357	702986	Jeff Linderoth	neos-pseudoapplication-30	5290	benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack binpacking knapsack mixed_binary general_linear

Reference

No bibliographic information available