A robust and cooperative parallel tabu search algorithm for the maximum vertex weight clique problem
暂无分享,去创建一个
[1] Lei Wu,et al. A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).
[2] Manuel Laguna,et al. Tabu Search , 1997 .
[3] Jin-Kao Hao,et al. Breakout Local Search for maximum clique problems , 2013, Comput. Oper. Res..
[4] Alok Singh,et al. A hybrid heuristic for the maximum clique problem , 2006, J. Heuristics.
[5] Patric R. J. Östergård,et al. A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..
[6] Fred W. Glover,et al. A Tabu search based clustering algorithm and its parallel implementation on Spark , 2017, Appl. Soft Comput..
[7] Fred W. Glover,et al. Solving the maximum vertex weight clique problem via 1 binary quadratic programming 2 , 2016 .
[8] Anand Subramanian,et al. A hybrid iterated local search heuristic for the maximum weight independent set problem , 2018, Optim. Lett..
[9] Tansel Dökeroglu,et al. A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem , 2016, Eng. Appl. Artif. Intell..
[10] Qinghua Wu,et al. A review on algorithms for maximum clique problems , 2015, Eur. J. Oper. Res..
[11] Wayne J. Pullan,et al. Simple ingredients leading to very efficient heuristics for the maximum clique problem , 2008, J. Heuristics.
[12] Wayne J. Pullan,et al. Approximating the maximum vertex/edge weighted clique using local search , 2008, J. Heuristics.
[13] P. Pardalos,et al. The Maximum Clique Problem , 1999, Handbook of Combinatorial Optimization.
[14] Dana H. Ballard,et al. Computer Vision , 1982 .
[15] D. Kumlander,et al. A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search , 2022, International Journal of Global Operations Research.
[16] Wayne J. Pullan,et al. Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..
[17] Ke Xu,et al. An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem , 2016, J. Artif. Intell. Res..
[18] J. Jeffry Howbert,et al. The Maximum Clique Problem , 2007 .
[19] Ulrich Faigle,et al. A cutting-plane approach to the edge-weighted maximal clique problem , 1993 .
[20] Tansel Dokeroglu,et al. Hybrid teaching–learning-based optimization algorithms for the Quadratic Assignment Problem , 2015 .
[21] Fred W. Glover,et al. Multi-neighborhood tabu search for the maximum weight clique problem , 2012, Annals of Operations Research.
[22] Illya V. Hicks,et al. Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem , 2006 .
[23] Abraham P. Punnen,et al. Clustered maximum weight clique problem: Algorithms and empirical analysis , 2017, Comput. Oper. Res..
[24] Yi Zhou,et al. PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem , 2017, Eur. J. Oper. Res..
[25] Tansel Dökeroglu,et al. A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the Steiner tree problem with revenue, budget and hop constraints , 2017, Soft Computing.
[26] Fred W. Glover,et al. Solving the maximum edge weight clique problem via unconstrained quadratic programming , 2007, Eur. J. Oper. Res..
[27] Michel Gendreau,et al. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..
[28] Jin-Kao Hao,et al. Opposition-Based Memetic Search for the Maximum Diversity Problem , 2017, IEEE Transactions on Evolutionary Computation.
[29] Carlo Mannino,et al. An Augmentation Algorithm for the Maximum Weighted Stable Set Problem , 1999, Comput. Optim. Appl..
[30] P. Pardalos,et al. An exact algorithm for the maximum clique problem , 1990 .
[31] Jin-Kao Hao,et al. A clique-based exact method for optimal winner determination in combinatorial auctions , 2016, Inf. Sci..
[32] Fred W. Glover,et al. A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..
[33] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[34] Stanislav Busygin,et al. A new trust region technique for the maximum weight clique problem , 2006, Discret. Appl. Math..
[35] Volker Stix,et al. Approximating the maximum weight clique using replicator dynamics , 2000, IEEE Trans. Neural Networks Learn. Syst..
[36] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.