A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs

2019 ◽  
Vol 24 (5) ◽  
pp. 3551-3567
Author(s):  
Ender Sevinc ◽  
Tansel Dokeroglu
2020 ◽  
Vol 39 (4) ◽  
pp. 933-954
Author(s):  
Yi Chu ◽  
Boxiao Liu ◽  
Shaowei Cai ◽  
Chuan Luo ◽  
Haihang You

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Carolina Lagos ◽  
Guillermo Guerrero ◽  
Enrique Cabrera ◽  
Stefanie Niklander ◽  
Franklin Johnson ◽  
...  

A novel matheuristic approach is presented and tested on a well-known optimisation problem, namely, capacitated facility location problem (CFLP). The algorithm combines local search and mathematical programming. While the local search algorithm is used to select a subset of promising facilities, mathematical programming strategies are used to solve the subproblem to optimality. Proposed local search is influenced by instance-specific information such as installation cost and the distance between customers and facilities. The algorithm is tested on large instances of the CFLP, where neither local search nor mathematical programming is able to find good quality solutions within acceptable computational times. Our approach is shown to be a very competitive alternative to solve large-scale instances for the CFLP.


2018 ◽  
Vol 69 (6) ◽  
pp. 849-863 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Peng Zhao ◽  
Yupeng Zhou ◽  
Minghao Yin

Sign in / Sign up

Export Citation Format

Share Document