pb-market-split8-70-4

binary feasibility knapsack mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	71	17	9.22121e-01	hard	pb-	0.0	pb-market-split8-70-4.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	71	70
Constraints	17	16
Binaries	71	70
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.922121	0.992857
Nonzeroes	1113	1112

Constraint Classification Properties
	Original	Presolved
Total	17	16
Empty	0	0
Free	0	0
Singleton	1	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	0	0
Bin Packing	0	0
Knapsack	0	8
Integer Knapsack	0	0
Mixed Binary	16	8
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 %		12.5000	12.5000	12.5000	12.5000
Variable %		97.1429	97.1429	97.1429	97.1429
Score	0.003571

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	0	0	0	0	0	Daiki Tanaka	2023-11-10	Computed with meet-in-the-middle enumeration. In about 16 days on an Intel Xeon CPU E5-2640 v3 2.6GHz * 2

Similar instances in collection

The following instances are most similar to pb-market-split8-70-4 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	Continuous	Constraints	Nonz.	Submitter	Group	Objective	Tags
p2m2p1m1p0n100	easy	100	100	0	1	100	B. Krishnamoorthy, G. Pataki	–	Infeasible	infeasible binary benchmark_suitable knapsack mixed_binary
mod008inf	easy	319	319	0	7	1562	MIPLIB submission pool	mod	Infeasible	infeasible binary knapsack mixed_binary
d20200	open	4000	4000	0	1502	189389	COR@L test set	–	12239.0*	binary decomposition set_partitioning invariant_knapsack knapsack
fhnw-binpack4-18	easy	520	481	39	650	2392	Simon Felix	binpack	Infeasible	infeasible feasibility benchmark_suitable invariant_knapsack mixed_binary
pg	easy	2700	100	2600	125	5200	M. Dawande	–	-8674.34260712	benchmark decomposition benchmark_suitable mixed_binary

Reference

No bibliographic information available