Issue: 2020/Vol.30/No.1, Pages 5-24
THE DOMINATION OVER TIME AND ITS DISCRETISATION
Nazanin Abbasnezhad
, Javad Mehri-Takmeh, Javad Vakili
Cite as: N. Abbasnezhad, J. Mehri-Takmeh, J. Vakili. The domination over time and its discretisation. Operations Research and Decisions 2020: 30(1), 5-24. DOI 10.37190/ord200101
Abstract
Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.
Keywords: domination over time, continuous linear programming, duality, discretisation
Received: 5 May 2019 Accepted: 27 April 2020