A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

Melchiori, A. and Sgalambro, A. orcid.org/0000-0002-0052-4950 (2018) A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem. Computers and Operations Research, 92. pp. 111-129. ISSN 0305-0548

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2017 Elsevier. This is an author produced version of a paper subsequently published in Computers & Operations 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: Quickest flow; k-splittable flow; Matheuristics; Flows over time; Multicommodity
Dates:
  • Published: 1 April 2018
  • Published (online): 14 December 2017
  • Accepted: 13 December 2017
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: 08 Jan 2018 14:42
Last Modified: 08 Jan 2018 14:42
Published Version: https://doi.org/10.1016/j.cor.2017.12.012
Status: Published online
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.cor.2017.12.012

Download

Accepted Version


Embargoed until: 14 December 2019

Filename: Deposit_Manuscript_COR_Melchiori_Sgalambro.pdf

Licence: CC-BY-NC-ND 4.0

Request a copy

Share / Export

Statistics