Data

Daily Decomposition and Optimal Solutions

RMIT University, Australia
Vishmi Fernando (Aggregated by)
Viewed: [[ro.stat.viewed]] Cited: [[ro.stat.cited]] Accessed: [[ro.stat.accessed]]
ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2FANDS&rft_id=info:doi10.25439/rmt.32004717.v1&rft.title=Daily Decomposition and Optimal Solutions&rft.identifier=10.25439/rmt.32004717.v1&rft.publisher=RMIT University, Australia&rft.description=Daily decomposition (TDFM) solutions for location classes Cluster, Random and RandomCluster and problem sizes 30, 50, 70 and 90.Optimal solutions for location classes Cluster, Random and RandomCluster and problem sizes 10, 15 and 20.&rft.creator=Vishmi Fernando&rft.date=2026&rft_rights= https://creativecommons.org/licenses/by/4.0/&rft_subject=Operations research&rft_subject=Optimisation&rft_subject=TDFM solutions&rft_subject=optimal solutions&rft_subject=single nurse routing and scheduling problem for chemotherapy and infusion&rft.type=dataset&rft.language=English Access the data
Cite Saved to MyRDA Save to MyRDA

Full description

Daily decomposition (TDFM) solutions for location classes Cluster, Random and RandomCluster and problem sizes 30, 50, 70 and 90.

Optimal solutions for location classes Cluster, Random and RandomCluster and problem sizes 10, 15 and 20.


This dataset is part of a larger collection

Click to explore relationships graph
Help

Related People

Subjects
Operations research | Optimisation | TDFM solutions | optimal solutions | single nurse routing and scheduling problem for chemotherapy and infusion |

User Contributed Tags    

Login to tag this record with meaningful keywords to make it easier to discover

Identifiers