Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference18 articles.
1. Introduction to Sequencing and Scheduling;Baker,1974
2. Finding a maximum clique in an arbitrary graph;Balas;SIAM Journal of Computing,1986
3. Location on tree networks: p-centre and n-dispersion problems;Chandrasekaran;Mathematics of Operations Research,1981
4. An O(n log p)2 algorithm for the continuous p-center problem on a tree;Chandrasekaran;SIAM Journal of Algebraic Methods,1980
5. Polynomially bounded algorithms for locating p-centers on a tree;Chandrasekaran;Mathematical Programming,1982
Cited by
202 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dispersion problem on a convex polygon;Information Processing Letters;2025-01
2. Models For The Obnoxious Facility Dispersion Problem;J APPL SCI ENG;2025
3. Dispersion in a Polygon;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-09-01
4. Max-Min Diversification with Asymmetric Distances;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
5. Data distribution tailoring revisited: cost-efficient integration of representative data;The VLDB Journal;2024-04-12