One-pass heuristics for large-scale unconstrained binary quadratic problems
暂无分享,去创建一个
Fred W. Glover | Bahram Alidaee | Gary A. Kochenberger | César Rego | F. Glover | G. Kochenberger | C. Rego | B. Alidaee | César Rego
[1] R. Fortet. L’algebre de Boole et ses applications en recherche operationnelle , 1960 .
[2] J. Ben Rosen,et al. A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..
[3] Christoph Witzgall. Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .
[4] Bahram Alidaee,et al. A scatter search approach to unconstrained quadratic binary programs , 1999 .
[5] Fred W. Glover,et al. A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.
[6] G. Kochenberger,et al. 0-1 Quadratic programming approach for optimum solutions of two scheduling problems , 1994 .
[7] B. Freisleben,et al. Genetic algorithms for binary quadratic programming , 1999 .
[8] F. Glover,et al. Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .
[9] F. Harary. On the notion of balance of a signed graph. , 1953 .
[10] Pierre Hansen,et al. Constrained Nonlinear 0-1 Programming , 1989 .
[11] Fred W. Glover,et al. Network models in optimization and their applications in practice , 1992 .
[12] P. Hammer,et al. Quadratic knapsack problems , 1980 .
[13] John E. Beasley,et al. Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .
[14] Panos M. Pardalos,et al. Complexity of uniqueness and local search in quadratic 0-1 programming , 1992, Oper. Res. Lett..
[15] Kengo Katayama,et al. Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm , 2000, GECCO.
[16] Rene Rochette,et al. Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem , 1979 .
[17] Jakob Krarup,et al. Computer-aided layout design , 1978 .
[18] Andrea Lodi,et al. An evolutionary heuristic for quadratic 0-1 programming , 1999, Eur. J. Oper. Res..
[19] R. McBride,et al. An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .
[20] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[21] D. L. Jensen,et al. A Decomposition Method for Quadratic Programming , 1992, IBM Syst. J..
[22] F. Glover,et al. Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs , 1999 .
[23] P. Chardaire,et al. A Decomposition Method for Quadratic Zero-One Programming , 1995 .
[24] Talal M. Alkhamis,et al. Simulated annealing for the unconstrained quadratic pseudo-Boolean function , 1998, Eur. J. Oper. Res..
[25] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[26] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[27] Panos M. Pardalos,et al. A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..