s82

numerics aggregations set_partitioning set_packing cardinality invariant_knapsack binpacking knapsack mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Daniel Espinoza	1690631	87878	4.72682e-05	open	Spinoza	-33.7970576238223*	s82.mps.gz

Wine Scheduling problem with 82 jobs and four processing machines 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	1690631	1667649
Constraints	87878	87207
Binaries	1690577	1667614
Integers	0	0
Continuous	54	35
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	4.72682e-05	4.58830e-05
Nonzeroes	7022610	6672800

Constraint Classification Properties
	Original	Presolved
Total	87878	87207
Empty	39	0
Free	0	0
Singleton	24	0
Aggregations	1475	1466
Precedence	0	0
Variable Bound	0	0
Set Partitioning	2423	25738
Set Packing	77	78
Set Covering	77	0
Cardinality	83707	59817
Invariant Knapsack	0	61
Equation Knapsack	0	0
Bin Packing	1	1
Knapsack	20	11
Integer Knapsack	0	0
Mixed Binary	35	35
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
Constraint %
Variable %
Score

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	-33.79706	-33.79706	Peng Lin and Shaowei Cai	2024-10-02	PartiMIP Solver - A Dynamic Partitioning MIP Solver
2	-33.78524		Robert Ashford and Alkis Vazacopoulus	2019-12-18	Found using ODH\|CPlex
1	-33.75962	-33.75962	-	2018-10-12	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to s82 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
s55	easy	78141	78137	0	4	9892	317902	Daniel Espinoza	Spinoza	-22.15177316	benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
s250r10	easy	273142	273139	0	3	10962	1318607	Daniel Espinoza	Spinoza	-0.1717804834232	benchmark benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
s100	hard	364417	364417	0	0	14733	1777917	Daniel Espinoza	Spinoza	-0.1697235270583	benchmark binary benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack
supportcase6	easy	130052	130051	1	0	771	584976	Michael Winkler	–	51906.47737	benchmark benchmark_suitable set_partitioning cardinality general_linear
neos-4531126-vouga	open	169996	169996	0	0	7694	967980	Jeff Linderoth	neos-pseudoapplication-87	525030.8846192999*	binary decomposition numerics set_partitioning cardinality invariant_knapsack binpacking mixed_binary

Reference

No bibliographic information available