nursesched-sprint02

benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Haroldo Gambini Santos	10250	3522	5.65089e-03	easy	nursescheduling	57.99999999999999	nursesched-sprint02.mps.gz

Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	10250	10210
Constraints	3522	3512
Binaries	10230	10190
Integers	20	20
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00565089	0.00568890
Nonzeroes	204000	203990

Constraint Classification Properties
	Original	Presolved
Total	3522	3512
Empty	0	0
Free	0	0
Singleton	10	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	632	672
Set Packing	1410	1490
Set Covering	320	0
Cardinality	360	320
Invariant Knapsack	690	1010
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	80	0
General Linear	20	20
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	1.491362
Constraint %		0.1993170	2.3918	3.01822	3.95786
Variable %		0.0979432	3.3268	1.94907	7.93340
Score	0.685861

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	58	58	0	0	0	-	2018-10-12	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to nursesched-sprint02 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
nursesched-medium04	easy	29667	29613	54	0	8668	621829	Haroldo Gambini Santos	nursescheduling	237	decomposition benchmark_suitable set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear
nursesched-sprint-hidden09	easy	11650	11630	20	0	4872	208050	Haroldo Gambini Santos	nursescheduling	338	benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
nursesched-medium-hint03	hard	34248	34170	78	0	14062	622800	Haroldo Gambini Santos	nursescheduling	115	benchmark decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
neos-498623	easy	9861	8500	0	1361	2047	148434	NEOS Server Submission	neos-pseudoapplication-5	16.6	benchmark_suitable aggregations variable_bound set_partitioning set_packing mixed_binary general_linear
nursesched-sprint-late03	easy	11690	11670	20	0	5032	208410	Haroldo Gambini Santos	nursescheduling	48	decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear

Reference

@Article{Santos2016,
author="Santos, Haroldo G.
and Toffolo, T{\'u}lio A. M.
and Gomes, Rafael A. M.
and Ribas, Sabir",
title="Integer programming techniques for the nurse rostering problem",
journal="Annals of Operations Research",
year="2016",
volume="239",
number="1",
pages="225--251",
issn="1572-9338",
doi="10.1007/s10479-014-1594-6",
url="http://dx.doi.org/10.1007/s10479-014-1594-6"
}