Wenqi Huang

Theor. Comput. Sci., 2013

Heuristics for two-dimensional strip packing problem with 90° rotations.

[BibT_eX]

[DOI]

Yan Jin

Expert Syst. Appl., 2013

Iterated tabu search for the circular open dimension problem.

[BibT_eX]

[DOI]

Zhanghua Fu

Zhipeng Lü

Eur. J. Oper. Res., 2013

Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle.

[BibT_eX]

[DOI]

Zhipeng Lü

CoRR, 2013

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container.

[BibT_eX]

[DOI]

WenQi Huang

Zhanghua Fu

Sci. China Inf. Sci., 2013

A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2013

2012

Serial Symmetrical Relocation Algorithm for the Equal Sphere Packing Problem

[BibT_eX]

[DOI]

WenQi Huang

Liang Yu

CoRR, 2012

An efficient deterministic heuristic for two-dimensional rectangular packing.

[BibT_eX]

[DOI]

Yan Jin

Comput. Oper. Res., 2012

Corner occupying theorem for the two-dimensional integral rectangle packing problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2012

Packing Unequal Disks in a Circular Container Using a Population Based Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary Computing, 2012

2011

Global Optimization of Binary Lennard-Jones Clusters Using Three Perturbation Operators.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2011

Global optimization method for finding dense packings of equal circles in a circle.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

Bottom-Left Placement Theorem for Rectangle Packing

[BibT_eX]

[DOI]

CoRR, 2011

Analysis on the computability over the efficient utilization problem of the four-dimensional space-time

[BibT_eX]

[DOI]

CoRR, 2011

An efficient placement heuristic for three-dimensional rectangular packing.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

Quasi-physical global optimization method for solving the equal circle packing problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2011

A Quasi Physical Method for the Equal Sphere Packing Problem.

[BibT_eX]

[DOI]

WenQi Huang

Liang Yu

Proceedings of the IEEE 10th International Conference on Trust, 2011

An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem.

[BibT_eX]

[DOI]

Zhanghua Fu

Proceedings of the International Conference on Electronic and Mechanical Engineering and Information Technology, 2011

2010

Greedy vacancy search algorithm for packing equal circles in a square.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Solving the single-container loading problem by a fast heuristic method.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2010

A heuristic algorithm for cube packing with time schedule.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2010

A quasi-human algorithm for solving the three-dimensional rectangular packing problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2010

A caving degree based flake arrangement approach for the container loading problem.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2010

2009

A caving degree approach for the single container loading problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

A new heuristic algorithm for cuboids packing with no orientation constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

A pure quasi-human algorithm for solving the cuboid packing problem.

[BibT_eX]

[DOI]

Sci. China Ser. F Inf. Sci., 2009

2008

PERM for solving circle packing problem.

[BibT_eX]

[DOI]

Zhipeng Lü

Comput. Oper. Res., 2008

A New Method for Container Loading Problem.

[BibT_eX]

Proceedings of the 2008 International Conference on Scientific Computing, 2008

2007

An efficient heuristic algorithm for rectangle-packing problem.

[BibT_eX]

[DOI]

Simul. Model. Pract. Theory, 2007

Quasi-Physical Algorithm of an Off-Lattice Model for Protein Folding Problem.

[BibT_eX]

[DOI]

Jing-Fa Liu

J. Comput. Sci. Technol., 2007

A new heuristic algorithm for rectangle packing.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2007

A two-level search algorithm for 2D rectangular packing problem.

[BibT_eX]

[DOI]

Mao Chen

Comput. Ind. Eng., 2007

A New Heuristic Algorithm for Constrained Rectangle-Packing Problem.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2007

Extremal Optimization with Local Search for the Circular Packing Problem.

[BibT_eX]

[DOI]

Jian Liu

Proceedings of the Third International Conference on Natural Computation, 2007

A New Quasi-Human Algorithm for the Strongly Heterogeneous Container Loading Problem.

[BibT_eX]

[DOI]

Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology, 2007

An Efficient Algorithm for Solving the Container Loading Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

A Quasi-physical Algorithm for the Structure Optimization in an Off-lattice Protein Model.

[BibT_eX]

[DOI]

Jing-Fa Liu

Genom. Proteom. Bioinform., 2006

New heuristics for packing unequal circles into a circular container.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2006

Note on: An improved algorithm for the packing of unequal circles within a larger containing circle.

[BibT_eX]

[DOI]

Mao Chen

Comput. Ind. Eng., 2006

2005

Greedy algorithms for packing unequal circles into a rectangular container.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2005

Diversification and Determinism in Local Search for Satisfiability.

[BibT_eX]

[DOI]

Chu Min Li

Wen Qi Huang

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

Algorithm Based on Taboo Search and Shifting Bottleneck for Job Shop Scheduling.

[BibT_eX]

[DOI]

Zhi Huang

J. Comput. Sci. Technol., 2004

An improved shifting bottleneck procedure for the job shop scheduling problem.

[BibT_eX]

[DOI]

Aihua Yin

Comput. Oper. Res., 2004

A Short Note on a Simple Search Heuristic for the Diskspacking Problem.

[BibT_eX]

[DOI]

Kang Yan

Ann. Oper. Res., 2004

A Simulated Annealing Algorithm for the Circles Packing Problem.

[BibT_eX]

[DOI]

Defu Zhang

Proceedings of the Computational Science, 2004

2003

A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

A heuristic quasi-physical strategy for solving disks packing problem.

[BibT_eX]

[DOI]

Kang Yan

Simul. Model. Pract. Theory, 2002

An Algorithm Based on Tabu Search for Satisfiability Problem.

[BibT_eX]

[DOI]

Defu Zhang

Wang Houxiang

J. Comput. Sci. Technol., 2002

An effective quasi-human based heuristic for solving the rectangle packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

An improved algorithm for the packing of unequal circles within a larger containing circle.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

1999

A Cogitative Algorithm for Solving the Equal Circles Packing Problem.

[BibT_eX]

[DOI]

Yu-Liang Wu

C. K. Wong

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

A hopeful CNF-SAT algorithm - Its high efficiency, industrial application and limitation.

[BibT_eX]

[DOI]

Wei Li

J. Comput. Sci. Technol., 1998

1994

A Quasi-mechanical Method for Solving the Rectangle Covering Problem An Approach to Tackling NP Hard Problems.

[BibT_eX]

[DOI]

Gang-Qiang Wang

CVGIP Graph. Model. Image Process., 1994

1987

The hardness of the grid problem <i>G<sub>i</sub></i> Under the Routine Resolution Method.

[BibT_eX]

[DOI]