Search Results - person:"HUANG, WENQI"

Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container

Zeng, Zhizhong; Yu, Xinguo; He, Kun; Huang, Wenqi; Fu, … - In: European journal of operational research : EJOR 250 (2016) 2, pp. 615-627

Persistent link: https://www.econbiz.de/10011441726

Iterated tabu search for the circular open dimansion problem

Fu, Zhanghua; Huang, Wenqi; Lü, Zhipeng - In: European journal of operational research : EJOR 225 (2013) 2, pp. 236-243

Persistent link: https://www.econbiz.de/10009706121

An efficient deterministic heuristic for two-dimensional rectangular packing

He, Kun; Huang, Wenqi; Yan, Jin - In: Computers & operations research : and their … 39 (2012) 7, pp. 1355-1363

Persistent link: https://www.econbiz.de/10009408357

An efficient placement heuristic for three-dimensional rectangular packing

He, Kun; Huang, Wenqi - In: Computers & operations research : and their … 38 (2011) 1, pp. 227-233

Persistent link: https://www.econbiz.de/10008667391

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

Huang, Wenqi; Ye, Taofeng - In: European journal of operational research : EJOR 210 (2011) 3, pp. 474-481

Persistent link: https://www.econbiz.de/10008990086

Greedy vacancy search algorithm for packing equal circles in a square

Huang, Wenqi; Ye, Tao - In: Operations research letters 38 (2010) 5, pp. 378-382

Persistent link: https://www.econbiz.de/10008658900

A new heuristic algorithm for cuboids packing with no orientation constraints

Huang, Wenqi; He, Kun - In: Computers & operations research : and their … 36 (2009) 2, pp. 425-432

Persistent link: https://www.econbiz.de/10003795113

PERM for solving circle packing problem

Lü, Zhipeng; Huang, Wenqi - In: Computers & operations research : and their … 35 (2008) 5, pp. 1742-1755

Persistent link: https://www.econbiz.de/10003671218

Iterated tabu search for the circular open dimension problem

Fu, Zhanghua; Huang, Wenqi; Lü, Zhipeng - In: European Journal of Operational Research 225 (2013) 2, pp. 236-243

This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of...

Persistent link: https://www.econbiz.de/10011052401

Iterated tabu search for the circular open dimension problem

Fu, Zhanghua; Huang, Wenqi; Lü, Zhipeng - In: European journal of operational research : EJOR 225 (2013) 2, pp. 236-243

Persistent link: https://www.econbiz.de/10010053868