Name
Abstract | ||
|---|---|---|
A network is given whose edges need to be constructed (or restored after a disaster). The lengths of edges represent the required construction/restoration times given available resources, and one unit of length of the network can be constructed per unit of time. All points of the network are accessible for construction at any time. For each pair of vertices, a due date is given. It is required to find a construction schedule that minimizes the maximum lateness of all pairs of vertices, where the lateness of a pair is the difference between the time when the pair becomes connected by an already constructed path and the pair's due date. We introduce the problem and analyze its structural properties, present a mixed-integer linear programming formulation, develop a number of lower bounds that are integrated in a branch-and-bound algorithm, and discuss results of computational experiments both for instances based on randomly generated networks and for instances based on 2010 Chilean earthquake data. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1287/ijoc.2017.0796 | INFORMS JOURNAL ON COMPUTING |
Keywords | Field | DocType |
combinatorial optimization, networks: scheduling, programming: branch and bound, network restoration, network construction, integrated network design and scheduling | Pairwise comparison,Linear programming formulation,Mathematical optimization,Vertex (geometry),Combinatorial optimization,Unit of length,Minification,Network construction,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 1091-9856 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Averbakh | 1 | 699 | 54.76 |
| Jordi Pereira | 2 | 25 | 2.38 |