Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26776
Title: | Incremental network design with maximum flows | Contributor(s): | Kalinowski, Thomas (author) ; Matsypura, Dmytro (author); Savelsbergh, Martin W P (author) | Publication Date: | 2015-04-01 | Early Online Version: | 2014-10-13 | DOI: | 10.1016/j.ejor.2014.10.003 | Handle Link: | https://hdl.handle.net/1959.11/26776 | Abstract: | We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics. | Publication Type: | Journal Article | Source of Publication: | European Journal of Operational Research, 242(1), p. 51-62 | Publisher: | Elsevier BV | Place of Publication: | Netherlands | ISSN: | 1872-6860 0377-2217 |
Fields of Research (FoR) 2008: | 010303 Optimisation | Fields of Research (FoR) 2020: | 490304 Optimisation | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Socio-Economic Objective (SEO) 2020: | 280118 Expanding knowledge in the mathematical sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
---|---|
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
36
checked on Mar 9, 2024
Page view(s)
1,334
checked on Mar 8, 2023
Download(s)
4
checked on Mar 8, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.