seqsolve2short4288

aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Irv Lustig	207665	242244	2.04387e-05	open	seqsolve	83.9999999999994*	seqsolve2short4288.mps.gz

The 3 problems in this group (seqsolve1–seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	207665	174335
Constraints	242244	199219
Binaries	123834	97763
Integers	82835	75576
Continuous	996	996
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	2.04387e-05	2.52499e-05
Nonzeroes	1028180	876949

Constraint Classification Properties
	Original	Presolved
Total	242244	199219
Empty	0	0
Free	0	0
Singleton	149	0
Aggregations	0	121
Precedence	12381	0
Variable Bound	178200	151260
Set Partitioning	0	0
Set Packing	151	56
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	282	251
Equation Knapsack	0	0
Bin Packing	31442	28976
Knapsack	16222	15398
Integer Knapsack	2918	2779
Mixed Binary	33	1
General Linear	466	377
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	Int. Viol	Cons. Viol	Obj. Viol	Submitter	Date	Description
1	84		0	0	0	Michael Winkler	2024-01-16	found with Gurobi 10.0.2 on AMD EPYC 7313P 16-Core Processor with 264075352 kB memory and found with NoRel Heuristic

Similar instances in collection

The following instances are most similar to seqsolve2short4288 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
seqsolve1	open	207665	123834	82835	996	242243	1027681	Irv Lustig	seqsolve	4277.0*	aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack general_linear
seqsolve3short4288excess384	open	207665	123834	82835	996	242245	1028677	Irv Lustig	seqsolve	-40015.0*	aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
uccase8	easy	37413	9576	0	27837	53709	214625	Daniel Espinoza	uccase	11167.74532	benchmark_suitable aggregations variable_bound set_partitioning invariant_knapsack binpacking knapsack mixed_binary
fhnw-binschedule2	open	30973	30504	468	1	6503	134640	Simon Felix	fhnw-bin	2428*	decomposition variable_bound set_partitioning set_packing invariant_knapsack binpacking mixed_binary general_linear
fhnw-binschedule0	open	319319	316270	3048	1	58085	1382972	Simon Felix	fhnw-bin	16088.0*	decomposition variable_bound set_partitioning set_packing invariant_knapsack binpacking mixed_binary general_linear

Reference

No bibliographic information available