Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables
暂无分享,去创建一个
Fred W. Glover | Yang Wang | Abraham P. Punnen | Qinghua Wu | F. Glover | Yang Wang | Qinghua Wu | A. Punnen
[1] Fred W. Glover,et al. A tabu search based memetic algorithm for the maximum diversity problem , 2014, Eng. Appl. Artif. Intell..
[2] Fred W. Glover,et al. Diversification-driven tabu search for unconstrained binary quadratic problems , 2010, 4OR.
[3] Mauro Dell'Amico,et al. Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.
[4] Roded Sharan,et al. Discovering statistically significant biclusters in gene expression data , 2002, ISMB.
[5] Stefan Voß,et al. Tabu search techniques for the quadratic semiassignment problem , 1992 .
[6] Mark W. Lewis,et al. A new modeling and solution approach for the set-partitioning problem , 2008, Comput. Oper. Res..
[7] Fred W. Glover,et al. Path relinking for unconstrained binary quadratic programming , 2012, Eur. J. Oper. Res..
[8] André Rossi,et al. Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem , 2017, Comput. Ind. Eng..
[9] Micael Gallego,et al. Tabu search with strategic oscillation for the maximally diverse grouping problem , 2013, J. Oper. Res. Soc..
[10] Fred W. Glover,et al. Effective metaheuristic algorithms for the minimum differential dispersion problem , 2017, Eur. J. Oper. Res..
[11] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[12] Abraham P. Punnen,et al. Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis , 2017, Oper. Res. Lett..
[13] Abraham Duarte,et al. Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem , 2014, Comput. Oper. Res..
[14] Abraham P. Punnen,et al. A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..
[15] Fred W. Glover,et al. Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs , 2013, Eur. J. Oper. Res..
[16] Jieping Ye,et al. Mining discrete patterns via binary matrix factorization , 2009, KDD.
[17] Manuel Laguna,et al. Tabu Search , 1997 .
[18] J. Christopher Beck,et al. Principles for the Design of Large Neighborhood Search , 2009, J. Math. Model. Algorithms.
[19] Leslie Pérez Cáceres,et al. The irace package: Iterated racing for automatic algorithm configuration , 2016 .
[20] Stefan Voß,et al. Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..
[21] Francisco J. Rodríguez,et al. Tabu search with strategic oscillation for the quadratic minimum spanning tree , 2014 .
[22] Abraham P. Punnen,et al. Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms , 2015, Theor. Comput. Sci..
[23] Abraham P. Punnen,et al. The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases , 2012, Discret. Appl. Math..
[24] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[25] Yang Wang,et al. The bipartite quadratic assignment problem and extensions , 2016, Eur. J. Oper. Res..
[26] Philippe Galinier,et al. An efficient memetic algorithm for the graph partitioning problem , 2011, Ann. Oper. Res..
[27] Abraham P. Punnen,et al. Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem , 2017, Eur. J. Oper. Res..
[28] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[29] T. C. Edwin Cheng,et al. A tabu search/path relinking algorithm to solve the job shop scheduling problem , 2014, Comput. Oper. Res..
[30] Maciej Drwal. Algorithm for quadratic semi-assignment problem with partition size coefficients , 2014, Optim. Lett..
[31] Roberto Cordone,et al. Comparing local search metaheuristics for the maximum diversity problem , 2011, J. Oper. Res. Soc..
[32] Graham Kendall,et al. An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem , 2015 .
[33] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[34] Zhuo Wang,et al. Multi-neighborhood local search optimization for machine reassignment problem , 2016, Comput. Oper. Res..
[35] T. Stützle,et al. Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.
[36] Yang Wang,et al. An effective iterated tabu search for the maximum bisection problem , 2017, Comput. Oper. Res..
[37] Fred W. Glover,et al. A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..
[38] Mark W. Lewis,et al. A new approach for modeling and solving set packing problems , 2008, Eur. J. Oper. Res..
[39] Daniel Vanderpooten,et al. Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..