Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26796| Title: | Incremental network design with shortest paths | Contributor(s): | Baxter, Matthew (author); Elgindy, Tarek (author); Ernst, Andreas T (author); Kalinowski, Thomas (author) ; Savelsbergh, Martin W P (author) |
Publication Date: | 2014-11-01 | Early Online Version: | 2014-04-24 | DOI: | 10.1016/j.ejor.2014.04.018 | Handle Link: | https://hdl.handle.net/1959.11/26796 | Abstract: | We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest variant is NP-hard, analyze the worst-case performance of natural greedy heuristics, derive a 4-approximation algorithm, and conduct a small computational study. | Publication Type: | Journal Article | Source of Publication: | European Journal of Operational Research, 238(3), p. 675-684 | Publisher: | Elsevier BV | Place of Publication: | Netherlands | ISSN: | 1872-6860 0377-2217 |
Fields of Research (FoR) 2008: | 010303 Optimisation 010206 Operations Research |
Fields of Research (FoR) 2020: | 490304 Optimisation 490108 Operations research |
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
39
checked on Apr 6, 2024
Page view(s)
1,322
checked on Apr 2, 2023
Download(s)
2
checked on Apr 2, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.