fhnw-schedule-paira200

variable_bound mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Simon Felix	20300	40000	1.4747e-04	open	schedule	-19.2298568218154*	fhnw-schedule-paira200.mps.gz

Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem (“Pair A”, “Pair B” and “Slot”) - we expect “Pair B” to be the best formulation.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	20300	20246
Constraints	40000	39946
Binaries	20100	20046
Integers	0	0
Continuous	200	200
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000147470	0.000147997
Nonzeroes	119746	119692

Constraint Classification Properties
	Original	Presolved
Total	40000	39946
Empty	0	0
Free	0	0
Singleton	54	0
Aggregations	0	0
Precedence	0	0
Variable Bound	146	146
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	0
Integer Knapsack	0	0
Mixed Binary	39800	39800
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 %		99.6345	99.6345	99.6345	99.6345
Variable %		99.2789	99.2789	99.2789	99.2789
Score	0.007185

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	Submitter	Date	Description
4	-19.22986	-19.22986	0.0e+00	Dongdong Wan	2024-07-01	Taylor Solver - Taylor Lab of Huawei Solver
3	-19.15706		5.9e-06	Edward Rothberg	2020-04-22	Obtained with Gurobi 9.0 using the solution improvement heuristic
2	-18.25751		9.1e-06	Edward Rothberg	2019-12-13	Obtained with Gurobi 9.0
1	-12.68193	-12.68193	0.0e+00	-	2018-10-10	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to fhnw-schedule-paira200 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
fhnw-schedule-paira100	open	5150	5050	0	100	10000	29873	Simon Felix	schedule	-15.1131226682367*	variable_bound mixed_binary
fhnw-schedule-paira400	open	80600	80200	0	400	160000	479504	Simon Felix	schedule	-35.4988125672093*	variable_bound mixed_binary
nh97_potential	easy	1180	630	328	222	1916	5748	MIPLIB submission pool	–	1418	benchmark_suitable mixed_binary general_linear
pg	easy	2700	100	0	2600	125	5200	M. Dawande	–	-8674.34260712	benchmark decomposition benchmark_suitable mixed_binary
neos-5115478-kaveri	easy	3114	2976	0	138	6498	19392	Jeff Linderoth	neos-pseudoapplication-54	1233.99999999096	numerics aggregations precedence mixed_binary

Reference

No bibliographic information available