A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem
A Melchiori, A Sgalambro - European Journal of Operational Research, 2020 - Elsevier
In the literature on Network Optimization, k-splittable flows were introduced to enhance
modeling accuracy in cases where an upper bound on the number of supporting paths for …
modeling accuracy in cases where an upper bound on the number of supporting paths for …
SLA constraint quickest path problem for data transmission services in capacitated networks
In this paper, an extension has been made on the quickest path problem (QPP) with a
constraint of service level agreements and energy required for the data transmission …
constraint of service level agreements and energy required for the data transmission …
Dynamic flow problems with bounded number of paths: models, algorithms and applications
A Melchiori - 2019 - iris.uniroma1.it
In this thesis we investigate the concept of path limitations, expressed as the maximum
number of paths that can be activated by each distinct commodity, hence secured by the so …
number of paths that can be activated by each distinct commodity, hence secured by the so …