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
Subjects
Operations research |
Optimisation |
branch and bound |
chemotherapy infusions |
multi-period |
multi-visit |
routing |
scheduling |
User Contributed Tags
Login to tag this record with meaningful keywords to make it easier to discover
Identifiers
- DOI : 10.25439/RMT.33466264.V1
