Less is more approach: basic variable neighborhood search for the obnoxiousp-median problem-Reference-Cited by-同舟云学术

Less is more approach: basic variable neighborhood search for the obnoxiousp-median problem

Published:2019-03-01 Issue:1 Volume:27 Page:480-493
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Mladenović Nenad¹²,Alkandari Abdulaziz³,Pei Jun⁴⁵,Todosijević Raca⁶⁷,Pardalos Panos M.⁸

Affiliation:

1. Emirates College of Technology; Abu Dhabi United Arab Emirates

2. Ural Federal University; Yekaterinburg Russia

3. College of Technological Studies; Public Authority for Applied Education and Training; Kuwait City Kuwait

4. School of Management; Hefei University of Technology; Anhui Sheng China

5. Key Laboratory of Process Optimization and Intelligent Decision-Making; Ministry of Education; Hefei China

6. LAMIH UMR CNRS 8201; Université Polytechnique Hauts-de-France; 59313 Valenciennes Cedex 9 Famars France

7. Mathematical Institute of the Serbian Academy of Science and Arts; Kneza Mihaila 36 11000 Belgrade Serbia

8. Department of Industrial and Systems Engineering; Faculty of Engineering; University of Florida; Gainesville FL 32611-6595 USA

Funder

Serbian Ministry of Education, Science and Technological Development

Development of information technologies and systems for stimulation of personality's sustainable development as one of the bases of development of digital Kazakhstan

National Natural Science Foundation of China

Innovative Research Groups of the National Natural Science Foundation of China

Humanities and Social Sciences Foundation of the Chinese Ministry of Education

111 project

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/itor.12646/fullpdf

Reference27 articles.

1. A branch-and-cut method for the obnoxious p-median problem;Belotti;4OR,2007

2. A new adaptive multi-start technique for combinatorial global optimizations;Boese;Operations Research Letters,1994

3. Less is more: solving the max-mean diversity problem with variable neighborhood search;Brimberg;Information Sciences,2017

4. Solving the capacitated clustering problem with variable neighborhood search;Brimberg;Annals of Operations Research,2019

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Models For The Obnoxious Facility Dispersion Problem;J APPL SCI ENG;2025

2. An efficient probability-based VNS algorithm for delivery territory design;Computers & Operations Research;2024-10

3. Dispersed starting solutions in facility location: The case of the planar p-median problem;Computers & Operations Research;2024-09

4. A matheuristic for locating obnoxious facilities;Computers & Operations Research;2024-06

5. A parallel variable neighborhood search for α-neighbor facility location problems;Computers & Operations Research;2024-05