Data

Numerical results of the B&B algorithm experiments

RMIT University, Australia
Melih Ozlen (Aggregated by) Sona Taheri (Aggregated by) 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.33466264.v1&rft.title=Numerical results of the B&B algorithm experiments&rft.identifier=10.25439/rmt.33466264.v1&rft.publisher=RMIT University, Australia&rft.description=The results obtained from the computational experiments of the proposed branch and bound algorithm are presented.There are two sets of results: B&B algorithm (solved without a time limit until the entire tree was explored) and B&B algorithm with a 10 minute time limit.The data used is found here. https://doi.org/10.25439/rmt.26325706&rft.creator=Melih Ozlen&rft.creator=Sona Taheri&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=branch and bound&rft_subject=routing&rft_subject=scheduling&rft_subject=chemotherapy infusions&rft_subject=multi-period&rft_subject=multi-visit&rft.type=dataset&rft.language=English Access the data

Full description

The results obtained from the computational experiments of the proposed branch and bound algorithm are presented.

There are two sets of results: B&B algorithm (solved without a time limit until the entire tree was explored) and B&B algorithm with a 10 minute time limit.

The data used is found here. https://doi.org/10.25439/rmt.26325706

This dataset is part of a larger collection

Click to explore relationships graph
Subjects

User Contributed Tags    

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

Identifiers
ACN 633 798 857