Abstract

The crisp and fuzzy quadratic minimum spanning tree (Q-MST) problem can be formulated as a linear model, and thus, the global optimum can be obtained by the proposed method. Conventionally, the Q-MST problem, which contains a quadratic term in the objective function, is solved by genetic algorithm and other heuristic methods. However, these methods cannot guarantee to obtain a global optimal solution. To address this issue, the proposed method transforms the quadratic term into linear formulations for crisp and fuzzy Q-MST problems, and yields the global optimum solutions by linear integer programming. Two examples are given to demonstrate the proposed method in greater detail.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.