A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem

Melchiori, A. and Sgalambro, A. orcid.org/0000-0002-0052-4950 (2020) A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem. European Journal of Operational Research, 282 (3). pp. 846-857. ISSN 0377-2217

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 Elsevier. This is an author produced version of a paper subsequently published in European Journal of Operational Research. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords: Networks; Flows over time; Quickest flow; k-splittable flow; Branch and Price
Dates:
  • Accepted: 14 October 2019
  • Published (online): 17 October 2019
  • Published: 1 May 2020
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Social Sciences (Sheffield) > Sheffield University Management School
Depositing User: Symplectic Sheffield
Date Deposited: 28 Oct 2019 09:40
Last Modified: 09 Jul 2020 09:35
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.ejor.2019.10.016

Download

Accepted Version


Embargoed until: 17 October 2021

Filename: Melchiori_Sgalambro_Manuscript_EJOR_2019_accepted.pdf

Licence: CC-BY-NC-ND 4.0

Request a copy

file not available

Share / Export

Statistics