IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v59y2022i4d10.1007_s12597-022-00595-z.html
   My bibliography  Save this article

Speedup the optimization of maximal closure of a node-weighted directed acyclic graph

Author

Listed:
  • Zhi-Ming Chen
  • Cheng-Hsiung Lee

    (Chihlee University of Technology)

  • Hung-Lin Lai

    (Chihlee University of Technology)

Abstract

The maximal closure optimization problem of a node-weighted graph is a super class of the optimal monotonic Boolean function problem. It is known that the maximal closure optimization problem can be transformed to a min-s-t cut problem. This paper focuses on the complement problem of the maximal closure on a node-weighted directed acyclic graph, named optimal pruning of node-weighted directed acyclic graph (OPNWDAG). A variant of transformation is proposed and a framework of scheme is developed to speed up the solving time of the OPNWDAG. They also can be applied to solve the optimal monotonic Boolean function problem. The experiments show that the improvement is significant and the speedup of time complexity is $$O(n^{0.209} ) $$ O ( n 0.209 ) at least.

Suggested Citation

  • Zhi-Ming Chen & Cheng-Hsiung Lee & Hung-Lin Lai, 2022. "Speedup the optimization of maximal closure of a node-weighted directed acyclic graph," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1413-1437, December.
    • Handle: RePEc:spr:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00595-z
    DOI: 10.1007/s12597-022-00595-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-022-00595-z
    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/s12597-022-00595-z?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. P.Senthil Kumar, 2018. "PSK Method for Solving Intuitionistic Fuzzy Solid Transportation Problems," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 7(4), pages 62-99, October.
    2. Bruce Faaland & Kiseog Kim & Tom Schmitt, 1990. "A New Algorithm for Computing the Maximal Closure of a Graph," Management Science, INFORMS, vol. 36(3), pages 315-331, March.
    3. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    4. Gassner, Elisabeth, 2009. "Up- and downgrading the 1-center in a network," European Journal of Operational Research, Elsevier, vol. 198(2), pages 370-377, October.
    5. P. Senthil Kumar & R. Jahir Hussain, 2016. "A Simple Method for Solving Fully Intuitionistic Fuzzy Real Life Assignment Problem," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 7(2), pages 39-61, April.
    6. P. Senthil Kumar, 2019. "Intuitionistic fuzzy solid assignment problems: a software-based approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(4), pages 661-675, August.
    7. P. Senthil Kumar & R. Jahir Hussain, 2016. "Computationally simple approach for solving fully intuitionistic fuzzy real life transportation problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 7(1), pages 90-101, December.
    8. Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
    9. Kien Trung Nguyen & Ali Reza Sepasian, 2016. "The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 872-884, October.
    10. Kavita Gupta, 2018. "Solving the problem of industry by formulating it as a capacitated transportation problem," International Journal of Procurement Management, Inderscience Enterprises Ltd, vol. 11(6), pages 705-721.
    11. Kavita Gupta & Ritu Arora, 2018. "Solving the problem of industry by formulating it as a fractional capacitated transportation problem with bounds on rim conditions," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(2), pages 509-516, April.
    12. Fadl Dahan & Khalil El Hindi & Ahmed Ghoneim, 2017. "An Adapted Ant-Inspired Algorithm for Enhancing Web Service Composition," International Journal on Semantic Web and Information Systems (IJSWIS), IGI Global, vol. 13(4), pages 181-197, October.
    13. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    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. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    2. P. Senthil Kumar, 2019. "PSK Method for Solving Mixed and Type-4 Intuitionistic Fuzzy Solid Transportation Problems," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 10(2), pages 20-53, April.
    3. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    4. Abdelmalek Ouannou & Adil Brouri & Laila Kadi & Hafid Oubouaddi, 2022. "Identification of switched reluctance machine using fuzzy model," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(6), pages 2833-2846, December.
    5. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.
    6. P. Senthil Kumar, 2019. "Intuitionistic fuzzy solid assignment problems: a software-based approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(4), pages 661-675, August.
    7. Li Cheng & Liu Conglin, 2023. "Game analysis and pricing strategy of duopoly airlines based on service," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(3), pages 1103-1124, June.
    8. P. Senthil Kumar, 2018. "A Simple and Efficient Algorithm for Solving Type-1 Intuitionistic Fuzzy Solid Transportation Problems," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 9(3), pages 90-122, July.
    9. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.
    10. Bogdana Stanojević & Milan Stanojević & Sorin Nădăban, 2021. "Reinstatement of the Extension Principle in Approaching Mathematical Programming with Fuzzy Numbers," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    11. P. Senthil Kumar, 2018. "Linear Programming Approach for Solving Balanced and Unbalanced Intuitionistic Fuzzy Transportation Problems," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 9(2), pages 73-100, April.
    12. Csapó, Gergely & Müller, Rudolf, 2013. "Optimal mechanism design for the private supply of a public good," Games and Economic Behavior, Elsevier, vol. 80(C), pages 229-242.
    13. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    14. M. Vanhoucke, 2006. "An efficient hybrid search algorithm for various optimization problems," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/365, Ghent University, Faculty of Economics and Business Administration.
    15. P. Senthil Kumar, 2020. "Intuitionistic fuzzy zero point method for solving type-2 intuitionistic fuzzy transportation problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 37(3), pages 418-451.
    16. P.Senthil Kumar, 2018. "PSK Method for Solving Intuitionistic Fuzzy Solid Transportation Problems," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 7(4), pages 62-99, October.
    17. P. Senthil Kumar, 2018. "A note on 'a new approach for solving intuitionistic fuzzy transportation problem of type-2'," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 29(1), pages 102-129.
    18. Sharmistha Halder (Jana) & Biswapati Jana, 2020. "Application of fuzzy programming techniques to solve solid transportation problem with additional constraints," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 30(1), pages 67-84.
    19. Thomas Schmitt & Bruce Faaland, 2004. "Scheduling recurrent construction," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1102-1128, December.
    20. Kien Trung Nguyen & Huong Nguyen-Thu & Nguyen Thanh Hung, 2018. "On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(2), pages 147-159, 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:spr:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00595-z. 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.