pb-gfrd-pnc

binary equation_knapsack binpacking knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	27888	874	2.49187e-03	open	pb-	8844.0*	pb-gfrd-pnc.mps.gz

These are the instances from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these instances can only be handled by solvers accepting indicator constraints. For instances compiled with big-M/domain decomposition only, see my previous submission to MIPLIB. To recompile, create a directory MODELS, a list lst12_16.txt of the instances with full paths to mzn/dzn files of each instance per line, and say $> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt –slvPrf MZN-CPLEX –debug 1 –addOption “–timeout 3 -D fIndConstr=true -D fMIPdomains=false” –useJoinedName “–writeModel MODELS_IND/%s.mps” Alternatively, you can compile individual instance as follows: $> mzn-cplex -v -s -G linear –output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a –timeout 3 -D fIndConstr=true -D fMIPdomains=false –writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps 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	27888	25934
Constraints	874	848
Binaries	27888	25934
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00249187	0.00258407
Nonzeroes	60737	56829

Constraint Classification Properties
	Original	Presolved
Total	874	848
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	0	0
Equation Knapsack	548	522
Bin Packing	0	324
Knapsack	0	2
Integer Knapsack	0	0
Mixed Binary	326	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	2.120574
Constraint %		0.1179250	0.2934610	0.3537740	0.825472
Variable %		0.0424154	0.0844186	0.0848307	0.254492
Score	0.383967

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
3	8844	8844	Michael Winkler	2023-07-01	Found with Gurobi 10.0.1 on an AMD EPYC 7313P with 256 GB RAM, with defaults except for MIPGAP=0.
2	8890		Edward Rothberg	2019-12-13	Obtained with Gurobi 9.0
1	9307	9307	-	2018-10-11	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to pb-gfrd-pnc 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
pb-grow22	open	25124	25124	0	0	1320	154694	Gleb Belov	pb-	-417442.0*	binary equation_knapsack knapsack
pg5_34	easy	2600	100	0	2500	225	7700	M. Dawande	–	-14339.35345	benchmark decomposition benchmark_suitable mixed_binary
pg	easy	2700	100	0	2600	125	5200	M. Dawande	–	-8674.34260712	benchmark decomposition benchmark_suitable mixed_binary
nh97_potential	easy	1180	630	328	222	1916	5748	MIPLIB submission pool	–	1418	benchmark_suitable mixed_binary general_linear
pb-fit2d	easy	118500	118500	0	0	10525	1575578	Gleb Belov	pb-	-20425	binary decomposition benchmark_suitable equation_knapsack binpacking knapsack

Reference

No bibliographic information available