Author:
Brimberg Jack,Mladenović Nenad,Urošević Dragan,Ngai Eric
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference21 articles.
1. Clustering and domination in perfect graphs;Corneil;Discrete Applied Mathematics,1984
2. Mafioli F. Finding a best subtree on the tree. Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica, Milano; 1991.
3. Different formulations for solving the heaviest k-subgraph problem;Billionnet;Information Systems and Operational Research,2005
4. Finding dense subgraphs with semi-definite programming;Srivastav;Lecture Notes in Computer Science,1998
5. Good solutions to discrete noxious location problems via metaheuristics;Kincaid;Annals of Operations Research,1992
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献