IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v44y2009i2p343-361.html
   My bibliography  Save this article

Computing the metric dimension of graphs by genetic algorithms

Author

Listed:
  • Jozef Kratica
  • Vera Kovačević-Vujčić
  • Mirjana Čangalović

Abstract

No abstract is available for this item.

Suggested Citation

  • Jozef Kratica & Vera Kovačević-Vujčić & Mirjana Čangalović, 2009. "Computing the metric dimension of graphs by genetic algorithms," Computational Optimization and Applications, Springer, vol. 44(2), pages 343-361, November.
    • Handle: RePEc:spr:coopap:v:44:y:2009:i:2:p:343-361
    DOI: 10.1007/s10589-007-9154-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-007-9154-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-007-9154-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Stanimirovic, Zorica & Kratica, Jozef & Dugosija, Djordje, 2007. "Genetic algorithms for solving the discrete ordered median problem," European Journal of Operational Research, Elsevier, vol. 182(3), pages 983-1001, November.
    2. Jozef Kratica & Zorica Stanimirović, 2006. "SOLVING THE UNCAPACITATED MULTIPLE ALLOCATIONp-HUB CENTER PROBLEM BY GENETIC ALGORITHM," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 23(04), pages 425-437.
    3. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mladenović, Nenad & Kratica, Jozef & Kovačević-Vujčić, Vera & Čangalović, Mirjana, 2012. "Variable neighborhood search for metric dimension and minimal doubly resolving set problems," European Journal of Operational Research, Elsevier, vol. 220(2), pages 328-337.
    2. Wu, Jian & Wang, Li & Yang, Weihua, 2022. "Learning to compute the metric dimension of graphs," Applied Mathematics and Computation, Elsevier, vol. 432(C).

    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. Behrooz Alizadeh & Somayeh Bakhteh, 2017. "A modified firefly algorithm for general inverse p-median location problems under different distance norms," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 618-636, September.
    2. Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto, 2020. "A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 582-599, July.
    3. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.
    4. Puerto, Justo & Pérez-Brito, Dionisio & García-González, Carlos G., 2014. "A modified variable neighborhood search for the discrete ordered median problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 61-76.
    5. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.
    6. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
    7. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    8. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    9. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    10. Wang, Congke & Liu, Yankui & Yang, Guoqing, 2023. "Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    11. Ting L. Lei & Richard L. Church, 2014. "Vector Assignment Ordered Median Problem," International Regional Science Review, , vol. 37(2), pages 194-224, April.
    12. J. Fabian Meier & Uwe Clausen, 2018. "Solving Single Allocation Hub Location Problems on Euclidean Data," Transportation Science, INFORMS, vol. 52(5), pages 1141-1155, October.
    13. Qin, Hu & Zhang, Zizhen & Qi, Zhuxuan & Lim, Andrew, 2014. "The freight consolidation and containerization problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 37-48.
    14. Azizi, Nader & Salhi, Said, 2022. "Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor," European Journal of Operational Research, Elsevier, vol. 298(3), pages 834-854.
    15. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    16. Mohammadreza Hamidi & Mohammadreza Gholamian & Kamran Shahanaghi, 2014. "Developing prevention reliability in hub location models," Journal of Risk and Reliability, , vol. 228(4), pages 337-346, August.
    17. Niknamfar, Amir Hossein & Niaki, Seyed Taghi Akhavan, 2016. "Fair profit contract for a carrier collaboration framework in a green hub network under soft time-windows: Dual lexicographic max–min approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 129-151.
    18. Wang, Min & Cheng, Qing & Huang, Jincai & Cheng, Guangquan, 2021. "Research on optimal hub location of agricultural product transportation network based on hierarchical hub-and-spoke network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    19. Víctor Blanco, 2019. "Ordered p-median problems with neighbourhoods," Computational Optimization and Applications, Springer, vol. 73(2), pages 603-645, June.
    20. Nader Azizi, 2019. "Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods," Annals of Operations Research, Springer, vol. 272(1), pages 159-185, January.

    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:spr:coopap:v:44:y:2009:i:2:p:343-361. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.