The pairwise flowtime network construction problem

Autor: Igor Averbakh

Publikováno v: Operations Research Letters. 49:902-907

It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a fixed overa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1b8c6160e14f38e9cec2f9e82b3a4044
https://doi.org/10.1016/j.orl.2021.10.005

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams

Autor: Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics

Publikováno v: Averbakh, I, Bermany, O, Kalcsics, J & Krassx, D 2021, ' Location Problems with Continuous Demand and Unreliable Facilities: Applications of Families of Incremental Voronoi Diagrams ', Discrete Applied Mathematics, vol. 300, pp. 36-55 . https://doi.org/10.1016/j.dam.2021.05.002

We consider conditional facility location problems with unreliable facilities that can fail with known probabilities. The demand is uniformly distributed over a convex polygon in the rectilinear plane where a number of facilities are already present,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25ec5a0bc39716e4a4a790dba633689e
https://doi.org/10.1016/j.dam.2021.05.002

Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights

Autor: Marina Leal, Oded Berman, Igor Averbakh

Publikováno v: Discrete Applied Mathematics. 239:193-199

In a recent paper Lopez-de-los-Mozos et al. (2013), an algorithmic approach was presented for the robust (minmax regret) absolute deviation single-facility location problem on networks with node weights which are linear functions of an uncertain or d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c66d563884f45353df7dd192f3505c21
https://doi.org/10.1016/j.dam.2017.12.036

Minimizing the makespan in multiserver network restoration problems

Autor: Igor Averbakh

Publikováno v: Networks. 70:60-68

Suppose that a destroyed network needs to be restored by a number of servers (construction crews) that are initially located at some nodes of the network (depots). Each server can restore one unit of length of the network per unit of time. When sever

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4c5f0fe03da136a9f7e7c4c05ab68787
https://doi.org/10.1002/net.21750

Network construction problems with due dates

Autor: Jordi Pereira, Igor Averbakh

Publikováno v: European Journal of Operational Research. 244:715-729

A network needs to be constructed by a server (construction crew) that has a constant construction speed which is incomparably slower than the server’s travel speed within the already constructed part of the network. A vertex is recovered when it b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8d7f6447b8bf70d403312d3bd5eb428c
https://doi.org/10.1016/j.ejor.2015.02.014