Author:
Akgün İbrahim,Tansel Barbaros Ç.
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference39 articles.
1. Computational methods for the diameter restricted minimum weight spanning tree problem;Achuthan;Australasian Journal of Combinatorics,1994
2. Akgun, I., Tansel, B.C., 2009. Degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints. Research Report, Bilkent University, Department of Industrial Engineering, Bilkent, Ankara (under review).
3. Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints;Akgun;Computers and Operations Research,2010
4. Network Flows: Theory, Algorithms and Applications;Ahuja,1993
5. Approximating minimum spanning tree of depth 2;Alfandari;International Transactions in Operational Research,1999
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On solving bi-objective constrained minimum spanning tree problems;Journal of Global Optimization;2023-05-25
2. Minimum weight clustered dominating tree problem;European Journal of Operational Research;2023-04
3. Hop-Constrained Metric Embeddings and their Applications;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Tree embeddings for hop-constrained network design;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem;Annals of Operations Research;2019-10-29