The hardness of the grid problem Gi Under the Routine Resolution Method. - Wenqi Huang 001; Chusheng Lai; Zhixiang Chen 001 (Math. Log. Q., 1987)

A Quasi-mechanical Method for Solving the Rectangle Covering Problem An Approach to Tackling NP Hard Problems. - Wen-Qi Huang 001; Gang-Qiang Wang (CVGIP Graph. Model. Image Process., 1994)

A hopeful CNF-SAT algorithm - Its high efficiency, industrial application and limitation. - Wenqi Huang 001; Wei Li 022 (J. Comput. Sci. Technol., 1998)

A Cogitative Algorithm for Solving the Equal Circles Packing Problem. - Wenqi Huang 001; Yu-Liang Wu; C. K. Wong (Handbook of Combinatorial Optimization, 1999)

An improved algorithm for the packing of unequal circles within a larger containing circle. - Huaiqing Wang; Wenqi Huang 001; Quan Zhang; Dongming Xu (Eur. J. Oper. Res., 2002)

An effective quasi-human based heuristic for solving the rectangle packing problem. - Yu-Liang Wu; Wenqi Huang 001; Siu-Chung Lau; C. K. Wong; Gilbert H. Young (Eur. J. Oper. Res., 2002)

An Algorithm Based on Tabu Search for Satisfiability Problem. - Wenqi Huang 001; Defu Zhang; Wang Houxiang (J. Comput. Sci. Technol., 2002)

A heuristic quasi-physical strategy for solving disks packing problem. - Wenqi Huang 001; Kang Yan (Simul. Model. Pract. Theory, 2002)

A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. - Wen Qi Huang 001; Yu Li 012; Bernard Jurkowiak; Chu Min Li 001; Ru Chu Xu (CP, 2003)

A Simulated Annealing Algorithm for the Circles Packing Problem. - Defu Zhang; Wenqi Huang 001 (International Conference on Computational Science, 2004)

A Short Note on a Simple Search Heuristic for the Diskspacking Problem. - Wenqi Huang 001; Kang Yan (Ann. Oper. Res., 2004)

An improved shifting bottleneck procedure for the job shop scheduling problem. - Wenqi Huang 001; Aihua Yin (Comput. Oper. Res., 2004)

Algorithm Based on Taboo Search and Shifting Bottleneck for Job Shop Scheduling. - Wen-Qi Huang 001; Zhi Huang (J. Comput. Sci. Technol., 2004)

Diversification and Determinism in Local Search for Satisfiability. - Chu Min Li 001; Wen Qi Huang 001 (SAT, 2005)

Greedy algorithms for packing unequal circles into a rectangular container. - Wen Qi Huang 001; Yu Li 012; Hakim Akeb; Chu Min Li 001 (J. Oper. Res. Soc., 2005)

Note on: An improved algorithm for the packing of unequal circles within a larger containing circle. - Wenqi Huang 001; Mao Chen 002 (Comput. Ind. Eng., 2006)

New heuristics for packing unequal circles into a circular container. - Wen Qi Huang 001; Yu Li 012; Chu Min Li 001; Ru Chu Xu (Comput. Oper. Res., 2006)

A Quasi-physical Algorithm for the Structure Optimization in an Off-lattice Protein Model. - Jing-Fa Liu; Wen-Qi Huang 001 (Genom. Proteom. Bioinform., 2006)

An Efficient Algorithm for Solving the Container Loading Problem. - Wenqi Huang 001; Kun He 001 (ESCAPE, 2007)

A New Quasi-Human Algorithm for the Strongly Heterogeneous Container Loading Problem. - Wenqi Huang 001; Kun He 001 (FCST, 2007)

Extremal Optimization with Local Search for the Circular Packing Problem. - Wenqi Huang 001; Jian Liu (ICNC (5), 2007)

A New Heuristic Algorithm for Constrained Rectangle-Packing Problem. - Duanbing Chen; Wenqi Huang 001 (Asia Pac. J. Oper. Res., 2007)

A two-level search algorithm for 2D rectangular packing problem. - Mao Chen 002; Wenqi Huang 001 (Comput. Ind. Eng., 2007)

A new heuristic algorithm for rectangle packing. - Wenqi Huang 001; Duanbing Chen; Ruchu Xu (Comput. Oper. Res., 2007)

Quasi-Physical Algorithm of an Off-Lattice Model for Protein Folding Problem. - Jing-Fa Liu; Wen-Qi Huang 001 (J. Comput. Sci. Technol., 2007)

An efficient heuristic algorithm for rectangle-packing problem. - Wenqi Huang 001; Duanbing Chen (Simul. Model. Pract. Theory, 2007)

A New Method for Container Loading Problem. - Kun He 001; Wenqi Huang 001 (CSC, 2008)

PERM for solving circle packing problem. - Zhipeng Lü; Wenqi Huang 001 (Comput. Oper. Res., 2008)

A pure quasi-human algorithm for solving the cuboid packing problem. - Wenqi Huang 001; Kun He 001 (Sci. China Ser. F Inf. Sci., 2009)

A new heuristic algorithm for cuboids packing with no orientation constraints. - Wenqi Huang 001; Kun He 001 (Comput. Oper. Res., 2009)

A caving degree approach for the single container loading problem. - Wenqi Huang 001; Kun He 001 (Eur. J. Oper. Res., 2009)

A caving degree based flake arrangement approach for the container loading problem. - Kun He 001; Wenqi Huang 001 (Comput. Ind. Eng., 2010)

A quasi-human algorithm for solving the three-dimensional rectangular packing problem. - Kun He 001; Wenqi Huang 001 (Sci. China Inf. Sci., 2010)

A heuristic algorithm for cube packing with time schedule. - Wei Li 022; WenQi Huang 001; Dongchen Jiang; Xianglong Liu 001 (Sci. China Inf. Sci., 2010)

Solving the single-container loading problem by a fast heuristic method. - Kun He 001; Wenqi Huang 001 (Optim. Methods Softw., 2010)

Greedy vacancy search algorithm for packing equal circles in a square. - Wenqi Huang 001; Tao Ye 005 (Oper. Res. Lett., 2010)

An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem. - Wenqi Huang 001; Zhanghua Fu; Ruchu Xu (EMEIT, 2011)

A Quasi Physical Method for the Equal Sphere Packing Problem. - WenQi Huang 001; Liang Yu (TrustCom, 2011)

Quasi-physical global optimization method for solving the equal circle packing problem. - Wenqi Huang 001; Tao Ye 005 (Sci. China Inf. Sci., 2011)

An efficient placement heuristic for three-dimensional rectangular packing. - Kun He 001; Wenqi Huang 001 (Comput. Oper. Res., 2011)

Analysis on the computability over the efficient utilization problem of the four-dimensional space-time - Wenqi Huang 001; Kun He 001 (CoRR, 2011)

Bottom-Left Placement Theorem for Rectangle Packing - Wenqi Huang 001; Tao Ye 005; Duanbing Chen (CoRR, 2011)

Global optimization method for finding dense packings of equal circles in a circle. - Wenqi Huang 001; Tao Ye 005 (Eur. J. Oper. Res., 2011)

Global Optimization of Binary Lennard-Jones Clusters Using Three Perturbation Operators. - Tao Ye 005; Ruchu Xu; Wenqi Huang 001 (J. Chem. Inf. Model., 2011)

Packing Unequal Disks in a Circular Container Using a Population Based Algorithm. - Wenqi Huang 001; Zhizhong Zeng; Ruchu Xu; Zhanghua Fu (ICGEC, 2012)

Corner occupying theorem for the two-dimensional integral rectangle packing problem. - Wenqi Huang 001; Tao Ye 005; Duanbing Chen (Sci. China Inf. Sci., 2012)

An efficient deterministic heuristic for two-dimensional rectangular packing. - Kun He 001; Wenqi Huang 001; Yan Jin 005 (Comput. Oper. Res., 2012)

Serial Symmetrical Relocation Algorithm for the Equal Sphere Packing Problem - WenQi Huang 001; Liang Yu (CoRR, 2012)

A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints. - Kun He 001; Danzeng Mo; Tao Ye 005; Wenqi Huang 001 (Comput. Ind. Eng., 2013)

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container. - WenQi Huang 001; Zhanghua Fu; Ruchu Xu (Sci. China Inf. Sci., 2013)

Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle. - Tao Ye 005; Wenqi Huang 001; Zhipeng Lü (CoRR, 2013)

Iterated tabu search for the circular open dimension problem. - Zhanghua Fu; Wenqi Huang 001; Zhipeng Lü (Eur. J. Oper. Res., 2013)

Heuristics for two-dimensional strip packing problem with 90° rotations. - Kun He 001; Yan Jin 005; Wenqi Huang 001 (Expert Syst. Appl., 2013)

On the weak computability of a four dimensional orthogonal packing and time scheduling problem. - Wenqi Huang 001; Kun He 001 (Theor. Comput. Sci., 2013)

Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container. - Zhizhong Zeng; Xinguo Yu; Kun He 001; Wenqi Huang 001; Zhanghua Fu (Eur. J. Oper. Res., 2016)