Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming
暂无分享,去创建一个
Fred W. Glover | Jin-Kao Hao | Yang Wang | Zhipeng Lü | F. Glover | Jin-Kao Hao | Yang Wang | Zhipeng Lü
[1] F. Glover,et al. Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .
[2] Fred W. Glover,et al. Diversification-driven tabu search for unconstrained binary quadratic problems , 2010, 4OR.
[3] Fred W. Glover,et al. A hybrid metaheuristic approach to solving the UBQP problem , 2010, Eur. J. Oper. Res..
[4] Saïd Salhi,et al. An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem , 2009, Eur. J. Oper. Res..
[5] Terry Jones,et al. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.
[6] Fred W. Glover,et al. A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..
[7] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[8] Weixiong Zhang,et al. Configuration landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability , 2004, Artif. Intell..
[9] Gintaras Palubeckis,et al. Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem , 2004, Ann. Oper. Res..
[10] Larry J. Eshelman,et al. Proceedings of the 6th International Conference on Genetic Algorithms , 1995 .
[11] P. Merz,et al. Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.
[12] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .