Author of the publication

How to Locate Disperse Obnoxious Facility Centers?

, , , and . ICVNS, volume 11328 of Lecture Notes in Computer Science, page 52-63. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem., and . CAEPIA, volume 9422 of Lecture Notes in Computer Science, page 322-331. Springer, (2015)Finding Critical Nodes in Networks Using Variable Neighborhood Search., , and . ICVNS, volume 12559 of Lecture Notes in Computer Science, page 1-13. Springer, (2021)BVNS for Overlapping Community Detection., , , and . ICVNS, volume 13863 of Lecture Notes in Computer Science, page 27-41. Springer, (2022)An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem., , , , and . MIC, volume 13838 of Lecture Notes in Computer Science, page 485-490. Springer, (2022)How to Locate Disperse Obnoxious Facility Centers?, , , and . ICVNS, volume 11328 of Lecture Notes in Computer Science, page 52-63. Springer, (2018)A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs., , , and . MIC, volume 13838 of Lecture Notes in Computer Science, page 554-559. Springer, (2022)Estimating the Spanish Energy Demand Using Variable Neighborhood Search., , and . CAEPIA, volume 9868 of Lecture Notes in Computer Science, page 341-350. Springer, (2016)Detecting Weak Points in Networks Using Variable Neighborhood Search., , and . ICVNS, volume 11328 of Lecture Notes in Computer Science, page 141-151. Springer, (2018)A quick GRASP-based method for influence maximization in social networks., , , and . J. Ambient Intell. Humaniz. Comput., 14 (4): 3767-3779 (2023)A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem., , and . Optim. Lett., 16 (1): 301-331 (2022)