nursesched-medium04

decomposition benchmark_suitable set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Haroldo Gambini Santos 29667 8668 2.41812e-03 easy nursescheduling 237 nursesched-medium04.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 29667 29636
Constraints 8668 8637
Binaries 29613 29582
Integers 54 54
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00241812 0.00242922
Nonzeroes 621829 621798
Constraint Classification Properties
Original Presolved
Total 8668 8637
Empty 0 0
Free 0 0
Singleton 31 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 1736 1860
Set Packing 4371 4619
Set Covering 1000 8
Cardinality 1104 980
Invariant Knapsack 124 1116
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 248 0
General Linear 54 54
Indicator 0 0

Structure

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

value min median mean max
Components 1.505150
Constraint % 2.85979 2.85979 2.85979 2.85979
Variable % 3.22581 3.22581 3.22581 3.22581
Score 0.857937

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

Similar instances in collection

The following instances are most similar to nursesched-medium04 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-sprint02 easy 10250 10230 20 0 3522 204000 Haroldo Gambini Santos nursescheduling 57.99999999999999 benchmark 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-hidden09 easy 11650 11630 20 0 4872 208050 Haroldo Gambini Santos nursescheduling 338 benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
neos-1223462 easy 5495 5180 315 0 5890 47040 NEOS Server Submission neos-pseudoapplication-12 -751.0000000645 benchmark_suitable variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack knapsack general_linear
neos-850681 easy 2594 2479 16 99 2067 37113 NEOS Server Submission neos-pseudoapplication-12 2472 benchmark_suitable aggregations variable_bound set_partitioning set_packing 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"
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint