IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v258y2017i1d10.1007_s10479-016-2188-2.html
   My bibliography  Save this article

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death

Author

Listed:
  • Eduardo Álvarez-Miranda

    (Universidad de Talca)

  • Hesso Farhan

    (Biotechnology Institute Thurgau
    University of Konstanz)

  • Martin Luipersbeck

    (University of Vienna)

  • Markus Sinnl

    (University of Vienna)

Abstract

Experimental records show the existence of a biological linkage between neuronal death and Golgi apparatus fragmentation. The comprehension of such linkage should help to understand the dynamics undergoing neurological damage caused by diseases such as Alzheimer’s disease or amyotrophic lateral sclerosis. In this paper, the bi-objective minimum cardinality bottleneck Steiner tree problem along with an ad-hoc exact algorithm are proposed to study such phenomena. The proposed algorithm is based on integer programming and the so-called $$\epsilon $$ ϵ -constraint method. A key feature of the devised approach is that it allows an efficient integer programming formulation of the problem. The obtained results show that it is possible to obtain additional evidence supporting the hypothesis that alterations of the Golgi apparatus structure and neuronal death interact through the biological mechanisms underlying the outbreak and progression of neurodegenerative diseases. Moreover, the function of cellular response to stress as a biological linkage between these phenomena is also further investigated. Complementary, computational results on a synthetic dataset are also provided with the aim of reporting the performance of the proposed algorithm.

Suggested Citation

  • Eduardo Álvarez-Miranda & Hesso Farhan & Martin Luipersbeck & Markus Sinnl, 2017. "A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death," Annals of Operations Research, Springer, vol. 258(1), pages 5-30, November.
    • Handle: RePEc:spr:annopr:v:258:y:2017:i:1:d:10.1007_s10479-016-2188-2
    DOI: 10.1007/s10479-016-2188-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2188-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2188-2?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. Duin, C. W. & Volgenant, A., 1997. "The partial sum criterion for Steiner trees in graphs and shortest paths," European Journal of Operational Research, Elsevier, vol. 97(1), pages 172-182, February.
    2. Igor Ulitsky & Akshay Krishnamurthy & Richard M Karp & Ron Shamir, 2010. "DEGAS: De Novo Discovery of Dysregulated Pathways in Human Diseases," PLOS ONE, Public Library of Science, vol. 5(10), pages 1-14, October.
    3. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    4. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    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. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    2. Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
    3. Podinovski, Vladislav V., 2013. "Non-dominance and potential optimality for partial preference relations," European Journal of Operational Research, Elsevier, vol. 229(2), pages 482-486.
    4. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    5. Konur, Dinçer & Campbell, James F. & Monfared, Sepideh A., 2017. "Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers," Omega, Elsevier, vol. 71(C), pages 46-65.
    6. Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
    7. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    8. Shahryar Rahnamayan & Sedigheh Mahdavi & Kalyanmoy Deb & Azam Asilian Bidgoli, 2020. "Ranking Multi-Metric Scientific Achievements Using a Concept of Pareto Optimality," Mathematics, MDPI, vol. 8(6), pages 1-46, June.
    9. Acuna, Jorge A. & Zayas-Castro, José L. & Charkhgard, Hadi, 2020. "Ambulance allocation optimization model for the overcrowding problem in US emergency departments: A case study in Florida," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    10. Hadi Charkhgard & Martin Savelsbergh & Masoud Talebian, 2018. "Nondominated Nash points: application of biobjective mixed integer programming," 4OR, Springer, vol. 16(2), pages 151-171, June.
    11. Thai Doan Chuong, 2021. "Optimality and duality in nonsmooth composite vector optimization and applications," Annals of Operations Research, Springer, vol. 296(1), pages 755-777, January.
    12. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    13. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 597-618, November.
    14. C. Gutiérrez & B. Jiménez & V. Novo, 2011. "A generic approach to approximate efficiency and applications to vector optimization with set-valued maps," Journal of Global Optimization, Springer, vol. 49(2), pages 313-342, February.
    15. Xu Lei & Tang Shiyun & Deng Yanfei & Yuan Yuan, 2020. "Sustainable operation-oriented investment risk evaluation and optimization for renewable energy project: a case study of wind power in China," Annals of Operations Research, Springer, vol. 290(1), pages 223-241, July.
    16. Walter Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    17. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
    18. Walter J. Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    19. Xu, Pan & Wang, Lizhi & Beavis, William D., 2011. "An optimization approach to gene stacking," European Journal of Operational Research, Elsevier, vol. 214(1), pages 168-178, October.
    20. Atashpaz Gargari, Masoud & Sahraeian, Rashed, 2023. "An exact criterion space search method for a bi-objective nursing home location and allocation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 166-180.

    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:annopr:v:258:y:2017:i:1:d:10.1007_s10479-016-2188-2. 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.