default search action
Wenqi Huang 0001
Person information
- affiliation: Huazhong University of Science and Technology, Wuhan, China
Other persons with the same name
- Wenqi Huang
- Wenqi Huang 0002
— China Southern Power Grid, Guangzhou, China (and 1 more)
- Wenqi Huang 0003
- Wenqi Huang 0004
- Wenqi Huang 0005 — NVIDIA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j40]Zhizhong Zeng, Xinguo Yu, Kun He, Wenqi Huang, Zhanghua Fu:
Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container. Eur. J. Oper. Res. 250(2): 615-627 (2016) - 2013
- [j39]Kun He, Danzeng Mo, Tao Ye, Wenqi Huang:
A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints. Comput. Ind. Eng. 66(4): 1049-1060 (2013) - [j38]WenQi Huang, Zhanghua Fu, Ruchu Xu:
Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container. Sci. China Inf. Sci. 56(9): 1-14 (2013) - [j37]Zhanghua Fu, Wenqi Huang, Zhipeng Lü:
Iterated tabu search for the circular open dimension problem. Eur. J. Oper. Res. 225(2): 236-243 (2013) - [j36]Kun He, Yan Jin, Wenqi Huang:
Heuristics for two-dimensional strip packing problem with 90° rotations. Expert Syst. Appl. 40(14): 5542-5550 (2013) - [j35]Wenqi Huang, Kun He:
On the weak computability of a four dimensional orthogonal packing and time scheduling problem. Theor. Comput. Sci. 501: 1-10 (2013) - [i6]Tao Ye, Wenqi Huang, Zhipeng Lü:
Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle. CoRR abs/1306.0694 (2013) - 2012
- [j34]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner occupying theorem for the two-dimensional integral rectangle packing problem. Sci. China Inf. Sci. 55(11): 2466-2472 (2012) - [j33]Kun He, Wenqi Huang, Yan Jin:
An efficient deterministic heuristic for two-dimensional rectangular packing. Comput. Oper. Res. 39(7): 1355-1363 (2012) - [c10]Wenqi Huang, Zhizhong Zeng, Ruchu Xu, Zhanghua Fu:
Packing Unequal Disks in a Circular Container Using a Population Based Algorithm. ICGEC 2012: 437-440 - [i5]WenQi Huang, Liang Yu:
Serial Symmetrical Relocation Algorithm for the Equal Sphere Packing Problem. CoRR abs/1202.4149 (2012) - [i4]Zhanghua Fu, Wenqi Huang, Zhipeng Lü:
Iterated tabu search for the circular open dimension problem. CoRR abs/1206.1004 (2012) - 2011
- [j32]Wenqi Huang, Tao Ye:
Quasi-physical global optimization method for solving the equal circle packing problem. Sci. China Inf. Sci. 54(7): 1333-1339 (2011) - [j31]Kun He, Wenqi Huang:
An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. 38(1): 227-233 (2011) - [j30]Wenqi Huang, Tao Ye:
Global optimization method for finding dense packings of equal circles in a circle. Eur. J. Oper. Res. 210(3): 474-481 (2011) - [j29]Tao Ye, Ruchu Xu, Wenqi Huang:
Global Optimization of Binary Lennard-Jones Clusters Using Three Perturbation Operators. J. Chem. Inf. Model. 51(3): 572-577 (2011) - [c9]Wenqi Huang, Zhanghua Fu, Ruchu Xu:
An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem. EMEIT 2011: 4122-4125 - [c8]WenQi Huang, Liang Yu:
A Quasi Physical Method for the Equal Sphere Packing Problem. TrustCom 2011: 1684-1690 - [i3]Wenqi Huang, Kun He:
Analysis on the computability over the efficient utilization problem of the four-dimensional space-time. CoRR abs/1107.4150 (2011) - [i2]Wenqi Huang, Tao Ye, Duanbing Chen:
Bottom-Left Placement Theorem for Rectangle Packing. CoRR abs/1107.4463 (2011) - [i1]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem. CoRR abs/1111.3715 (2011) - 2010
- [j28]Kun He, Wenqi Huang:
A caving degree based flake arrangement approach for the container loading problem. Comput. Ind. Eng. 59(2): 344-351 (2010) - [j27]Wei Li, WenQi Huang, Dongchen Jiang, Xianglong Liu
A heuristic algorithm for cube packing with time schedule. Sci. China Inf. Sci. 53(1): 18-29 (2010) - [j26]Kun He, Wenqi Huang:
A quasi-human algorithm for solving the three-dimensional rectangular packing problem. Sci. China Inf. Sci. 53(12): 2389-2398 (2010) - [j25]Kun He, Wenqi Huang:
Solving the single-container loading problem by a fast heuristic method. Optim. Methods Softw. 25(2): 263-277 (2010) - [j24]Wenqi Huang, Tao Ye:
Greedy vacancy search algorithm for packing equal circles in a square. Oper. Res. Lett. 38(5): 378-382 (2010)
2000 – 2009
- 2009
- [j23]Wenqi Huang, Kun He:
A pure quasi-human algorithm for solving the cuboid packing problem. Sci. China Ser. F Inf. Sci. 52(1): 52-58 (2009) - [j22]Wenqi Huang, Kun He:
A new heuristic algorithm for cuboids packing with no orientation constraints. Comput. Oper. Res. 36(2): 425-432 (2009) - [j21]Wenqi Huang, Kun He:
A caving degree approach for the single container loading problem. Eur. J. Oper. Res. 196(1): 93-101 (2009) - 2008
- [j20]Zhipeng Lü, Wenqi Huang:
PERM for solving circle packing problem. Comput. Oper. Res. 35(5): 1742-1755 (2008) - [c7]Kun He, Wenqi Huang:
A New Method for Container Loading Problem. CSC 2008: 266-270 - 2007
- [j19]Duanbing Chen, Wenqi Huang:
A New Heuristic Algorithm for Constrained Rectangle-Packing Problem. Asia Pac. J. Oper. Res. 24(4): 463-478 (2007) - [j18]Mao Chen, Wenqi Huang:
A two-level search algorithm for 2D rectangular packing problem. Comput. Ind. Eng. 53(1): 123-136 (2007) - [j17]Wenqi Huang, Duanbing Chen, Ruchu Xu:
A new heuristic algorithm for rectangle packing. Comput. Oper. Res. 34(11): 3270-3280 (2007) - [j16]Jing-Fa Liu, Wen-Qi Huang:
Quasi-Physical Algorithm of an Off-Lattice Model for Protein Folding Problem. J. Comput. Sci. Technol. 22(4): 569-574 (2007) - [j15]Wenqi Huang, Duanbing Chen:
An efficient heuristic algorithm for rectangle-packing problem. Simul. Model. Pract. Theory 15(10): 1356-1365 (2007) - [c6]Wenqi Huang, Kun He:
An Efficient Algorithm for Solving the Container Loading Problem. ESCAPE 2007: 396-407 - [c5]Wenqi Huang, Kun He:
A New Quasi-Human Algorithm for the Strongly Heterogeneous Container Loading Problem. FCST 2007: 119-124 - [c4]Wenqi Huang, Jian Liu:
Extremal Optimization with Local Search for the Circular Packing Problem. ICNC (5) 2007: 19-23 - 2006
- [j14]Wenqi Huang, Mao Chen:
Note on: An improved algorithm for the packing of unequal circles within a larger containing circle. Comput. Ind. Eng. 50(3): 338-344 (2006) - [j13]Wen Qi Huang, Yu Li, Chu Min Li, Ru Chu Xu:
New heuristics for packing unequal circles into a circular container. Comput. Oper. Res. 33: 2125-2142 (2006) - [j12]Jing-Fa Liu, Wen-Qi Huang:
A Quasi-physical Algorithm for the Structure Optimization in an Off-lattice Protein Model. Genom. Proteom. Bioinform. 4(1): 61-66 (2006) - 2005
- [j11]Wen Qi Huang, Yu Li, Hakim Akeb
Greedy algorithms for packing unequal circles into a rectangular container. J. Oper. Res. Soc. 56(5): 539-548 (2005) - [c3]Chu Min Li, Wen Qi Huang:
Diversification and Determinism in Local Search for Satisfiability. SAT 2005: 158-172 - 2004
- [j10]Wenqi Huang, Kang Yan:
A Short Note on a Simple Search Heuristic for the Diskspacking Problem. Ann. Oper. Res. 131(1-4): 101-108 (2004) - [j9]Wenqi Huang, Aihua Yin:
An improved shifting bottleneck procedure for the job shop scheduling problem. Comput. Oper. Res. 31(12): 2093-2110 (2004) - [j8]Wen-Qi Huang, Zhi Huang:
Algorithm Based on Taboo Search and Shifting Bottleneck for Job Shop Scheduling. J. Comput. Sci. Technol. 19(6): 776-781 (2004) - [c2]Defu Zhang, Wenqi Huang:
A Simulated Annealing Algorithm for the Circles Packing Problem. International Conference on Computational Science 2004: 206-214 - 2003
- [c1]Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu:
A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. CP 2003: 868-872 - 2002
- [j7]Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young:
An effective quasi-human based heuristic for solving the rectangle packing problem. Eur. J. Oper. Res. 141(2): 341-358 (2002) - [j6]Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming Xu:
An improved algorithm for the packing of unequal circles within a larger containing circle. Eur. J. Oper. Res. 141(2): 440-453 (2002) - [j5]Wenqi Huang, Defu Zhang, Wang Houxiang:
An Algorithm Based on Tabu Search for Satisfiability Problem. J. Comput. Sci. Technol. 17(3): 340-346 (2002) - [j4]Wenqi Huang, Kang Yan:
A heuristic quasi-physical strategy for solving disks packing problem. Simul. Model. Pract. Theory 10(3-4): 195-207 (2002)
1990 – 1999
- 1999
- [p1]Wenqi Huang, Yu-Liang Wu, C. K. Wong:
A Cogitative Algorithm for Solving the Equal Circles Packing Problem. Handbook of Combinatorial Optimization 1999: 591-605 - 1998
- [j3]Wenqi Huang, Wei Li:
A hopeful CNF-SAT algorithm - Its high efficiency, industrial application and limitation. J. Comput. Sci. Technol. 13(1): 9-12 (1998) - 1994
- [j2]Wen-Qi Huang, Gang-Qiang Wang:
A Quasi-mechanical Method for Solving the Rectangle Covering Problem An Approach to Tackling NP Hard Problems. CVGIP Graph. Model. Image Process. 56(3): 267-271 (1994)
1980 – 1989
- 1987
- [j1]Wenqi Huang, Chusheng Lai, Zhixiang Chen:
The hardness of the grid problem Gi Under the Routine Resolution Method. Math. Log. Q. 33(1): 79-84 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-30 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: