Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference11 articles.
1. Carrabs, F., Cerrone, C., & Pentangelo, R. (2017). A multi-ethnic genetic approach for the minimum conflict weighted spanning tree problem. submitted to Networks.
2. Darmann, A., Pferschy, U., & Schauer, J. (2009). Determining a minimum spanning tree with disjunctive constraints. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5783 LNAI, 414–423.
3. Darmann, A., Pferschy, U., Schauer, J., & Woeginger, G. (2011). Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics, 159(16), 1726–1735.
4. Gerards, A. M. H., & Schrijver, A. (1986). Matrices with the Edmonds–Johnson property. Combinatorica, 6(4), 365–379.
5. Oncan, T., Zhang, R., & Punnen, A. (2013). The minimum cost perfect matching problem with conflict pair constraints. Computers and Operations Research, 40(4), 920–930.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献