IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v1y2020p5-24id1463.html
   My bibliography  Save this article

The domination over time and its discretisation

Author

Listed:
  • Nazanin Abbasnezhad
  • Javad Mehri-Takmeh
  • Javad Vakili

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.

Suggested Citation

  • Nazanin Abbasnezhad & Javad Mehri-Takmeh & Javad Vakili, 2020. "The domination over time and its discretisation," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 30(1), pages 5-24.
    • Handle: RePEc:wut:journl:v:1:y:2020:p:5-24:id:1463
    DOI: 10.37190/ord200101
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/1463%20-%20published.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord200101?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. S. Hashemi & Ebrahim Nasrabadi, 2012. "On solving continuous-time dynamic network flows," Journal of Global Optimization, Springer, vol. 53(3), pages 497-524, July.
    2. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    3. Anita Schöbel & Horst W. Hamacher & Annegret Liebers & Dorothea Wagner, 2009. "The Continuous Stop Location Problem In Public Transportation Networks," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(01), pages 13-30.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Koch, Ronald & Nasrabadi, Ebrahim, 2014. "Flows over time in time-varying networks: Optimality conditions and strong duality," European Journal of Operational Research, Elsevier, vol. 237(2), pages 580-589.
    2. Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    3. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    4. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    5. S. Khodayifar & M. A. Raayatpanah & P. M. Pardalos, 2019. "A polynomial time algorithm for the minimum flow problem in time-varying networks," Annals of Operations Research, Springer, vol. 272(1), pages 29-39, January.
    6. Hugo M. Repolho & António P. Antunes & Richard L. Church, 2013. "Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line," Transportation Science, INFORMS, vol. 47(3), pages 330-343, August.
    7. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    8. Anke Stieber & Armin Fügenschuh, 2022. "Dealing with time in the multiple traveling salespersons problem with moving targets," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 991-1017, September.
    9. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    10. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    11. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2007. "Fast, Fair, and Efficient Flows in Networks," Operations Research, INFORMS, vol. 55(2), pages 215-225, April.
    12. Manout, Ouassim & Bonnel, Patrick & Bouzouina, Louafi, 2018. "Transit accessibility: A new definition of transit connectors," Transportation Research Part A: Policy and Practice, Elsevier, vol. 113(C), pages 88-100.
    13. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    14. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    15. Francisco Pérez‐Villalonga & Javier Salmerón & Kevin Wood, 2008. "Dynamic evacuation routes for personnel on a naval ship," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(8), pages 785-799, December.
    16. Bretschneider, S. & Kimms, A., 2011. "A basic mathematical model for evacuation problems in urban areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 523-539, July.
    17. Bozhenyuk Alexander & Gerasimenko Evgeniya, 2013. "Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks," Information Technology and Management Science, Sciendo, vol. 16(1), pages 53-59, December.
    18. Jian Li & Kaan Ozbay, 2015. "Evacuation Planning with Endogenous Transportation Network Degradations: A Stochastic Cell-Based Model and Solution Procedure," Networks and Spatial Economics, Springer, vol. 15(3), pages 677-696, September.
    19. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    20. Ryo Yamamoto & Atsushi Takizawa, 2019. "Partitioning Vertical Evacuation Areas in Umeda Underground Mall to Minimize the Evacuation Completion Time," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 209-225, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wut:journl:v:1:y:2020:p:5-24:id:1463. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.