nursesched-medium-hint03

benchmark decomposition benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Haroldo Gambini Santos 34248 14062 1.2932e-03 hard nursescheduling 115 nursesched-medium-hint03.mps.gz

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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 34248 33990
Constraints 14062 13672
Binaries 34170 33930
Integers 78 60
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00129320 0.00133857
Nonzeroes 622800 622050
Constraint Classification Properties
Original Presolved
Total 14062 13672
Empty 0 0
Free 0 0
Singleton 30 0
Aggregations 0 0
Precedence 0 0
Variable Bound 360 0
Set Partitioning 1688 1808
Set Packing 4230 4470
Set Covering 960 0
Cardinality 1064 944
Invariant Knapsack 5430 6390
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 240 0
General Linear 60 60
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 1.959041
Constraint % 0.0511995 0.887459 0.775307 1.83587
Variable % 0.0294204 1.109150 0.914975 2.38305
Score 0.788126

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

Similar instances in collection

The following instances are most similar to nursesched-medium-hint03 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-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-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
nursesched-sprint02 easy 10250 10230 20 0 3522 204000 Haroldo Gambini Santos nursescheduling 58 benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
academictimetablesmall easy 28926 28926 0 0 23294 268350 Joshua Friedman 0 benchmark binary decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack binpacking knapsack
comp12-2idx open 11863 11820 43 0 16803 73677 Matias Sørensen coursetimetabling 391* decomposition precedence variable_bound set_partitioning cardinality invariant_knapsack mixed_binary 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"
}

Last Update Okt 02, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint