Solving maximal covering location problem using genetic algorithm with local refinement
- 期刊名称Soft Computing
- 作者Atta, Soumen; Sinha Mahapatra, Priya Ranjan; Mukhopadhyay, Anirban
- 印刷ISSN1432-7643
- 电子ISSN1433-7479
- 文件大小911.21KB
- 发表时间2017-4-20
- DOI10.1007/s00500-017-2598-3
Two poset polytopesRichard P. Stanley · Discrete and Computational Geometry · 1986
Voronoi diagrams and arrangementsHerbert Edelsbrunner; Raimund Seidel · Discrete and Computational Geometry · 1986
Can you cover your shadows?H. E. Debrunner; P. Mani-Levitska · Discrete and Computational Geometry · 1986
Computing circular separabilityJoseph O'Rourke; S. Rao Kosaraju; Nimrod Megiddo · Discrete and Computational Geometry · 1986
Smooth, easy to compute interpolating splinesJohn D. Hobby · Discrete and Computational Geometry · 1986
On polyhedra with transitivity propertiesJ. M. Wills · Discrete and Computational Geometry · 1986
Approximation of convex discs by polygonsA. Florian · Discrete and Computational Geometry · 1986
Diameter partitioningDavid Avis · Discrete and Computational Geometry · 1986