A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. - Ying Kong; Fan Wang 003; Andrew Lim 001; Songshan Guo (Australian Conference on Artificial Intelligence, 2003)

Resource constraints machine scheduling: a genetic algorithm approach. - Yanzhi Li; Fan Wang 003; Andrew Lim 001 (IEEE Congress on Evolutionary Computation, 2003)

A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem. - Songshan Guo; Ying Kong; Andrew Lim 001; Fan Wang 003 (Australian Conference on Artificial Intelligence, 2004)

On the Selection and Assignment with Minimum Quantity Commitments. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (COCOON, 2004)

Flexible Demand Assignment Problem. - Fan Wang 003; Andrew Lim 001; Hong Chen (ECAI, 2004)

Meta-Heuristics for Robust Graph Coloring Problem. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2004)

A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2004)

Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles. - Zhiye Li; Songshan Guo; Fan Wang 003; Andrew Lim 001 (IEA/AIE, 2004)

A genetic algorithm for machine scheduling problem under shared resource constraints. - Yanzhi Li; Fan Wang 003; Andrew Lim 001 (Int. J. Comput. Appl. Technol., 2004)

Robust Graph Coloring for Uncertain Supply Chain Management. - Andrew Lim 001; Fan Wang 003 (HICSS, 2005)

Robust Airport Gate Assignment. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2005)

The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (ISAAC, 2005)

The shortest route cut and fill problem in linear topological structure. - Songshan Guo; Weixing Li; Andrew Lim 001; Fan Wang 003 (SAC, 2005)

Multi-depot vehicle routing problem: a one-stage approach. - Andrew Lim 001; Fan Wang 003 (IEEE Trans Autom. Sci. Eng., 2005)

k-Center problems with minimum coverage. - Andrew Lim 001; Brian Rodrigues; Fan Wang 003; Zhou Xu 001 (Theor. Comput. Sci., 2005)

The one-commodity pickup and delivery travelling salesman problem on a path or a tree. - Fan Wang 003; Andrew Lim 001; Zhou Xu 001 (Networks, 2006)

A Transportation Problem with Minimum Quantity Commitment. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (Transp. Sci., 2006)

A Compromised Large-Scale Neighborhood Search Heuristic for Cargo Loading Planning. - Yanzhi Li; Yi Tao 002; Fan Wang 003 (Australian Conference on Artificial Intelligence, 2007)

A stochastic beam search for the berth allocation problem. - Fan Wang 003; Andrew Lim 001 (Decis. Support Syst., 2007)

On scheduling concurrent multicast sessions over resource reserved network. - Xiaoyu Zhang; Fan Wang 003 (ICON, 2008)

Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules. - Zhaowei Miao; Ke Fu; Qi Fei; Fan Wang 003 (IEA/AIE, 2008)

A Survey on Reviewer Assignment Problem. - Fan Wang 003; Ben Chen; Zhaowei Miao (IEA/AIE, 2008)

The bidding selection and assignment problem with minimum quantity commitment. - Andrew Lim 001; Zhou Xu 001; Fan Wang 003 (J. Oper. Res. Soc., 2008)

Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem. - Fan Wang 003; Andrew Lim 001 (IEEE Trans Autom. Sci. Eng., 2008)

A Survey on Vehicle Routing Problem with Loading Constraints. - Fan Wang 003; Yi Tao 002; Ning Shi (CSO (2), 2009)

A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning. - Yanzhi Li; Yi Tao 002; Fan Wang 003 (Eur. J. Oper. Res., 2009)

A new packing heuristic based algorithm for Vehicle Routing Problem with Three-dimensional Loading constraints. - Yi Tao 002; Fan Wang 003 (CASE, 2010)

A Comprehensive Survey of the Reviewer Assignment Problem. - Fan Wang 003; Ning Shi; Ben Chen (Int. J. Inf. Technol. Decis. Mak., 2010)

A multi-objective optimization for green supply chain network design. - Fan Wang 003; Xiaofan Lai; Ning Shi (Decis. Support Syst., 2011)

Group-to-group reviewer assignment problem. - Fan Wang 003; Shaorui Zhou; Ning Shi (Comput. Oper. Res., 2013)

Metaheuristics for robust graph coloring. - Fan Wang 003; Zhou Xu 001 (J. Heuristics, 2013)

Resource Allocation Problems in Port Operations: A Literature Review. - Jinjia Huang; Fan Wang 003; Ning Shi (CSO, 2014)

An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. - Zhou Xu 001; Xiaofan Lai; Andrew Lim 001; Fan Wang 003 (Networks, 2014)

An effective tabu search approach with improved loading algorithms for the 3L-CVRP. - Yi Tao 002; Fan Wang 003 (Comput. Oper. Res., 2015)

Optimal investment strategy under time-inconsistent preferences and high-water mark contract. - A. Chunxiang; Zhongfei Li; Fan Wang 003 (Oper. Res. Lett., 2016)

Effect of the Return Policy in a Continuous-Time Newsvendor Problem. - Weiwei Zhang; Zhongfei Li; Ke Fu; Fan Wang 003 (Asia Pac. J. Oper. Res., 2017)

A new convergent hybrid learning algorithm for two-stage stochastic programs. - Shaorui Zhou; Hui Zhang; Ning Shi; Zhou Xu 001; Fan Wang 003 (Eur. J. Oper. Res., 2020)

An AI Model for Oil Volatility Forecasting. - Fan Wang 003; Junqin Lin; Lijian Wei (IEEE Intell. Syst., 2020)

Pricing and Cargo Canvassing with Risk-Sensitive Shipping Lines: A Mean-Risk Analysis. - Xiaopo Zhuo; Fan Wang 003; Shaorui Zhou (Asia Pac. J. Oper. Res., 2021)

Financing the capital-constrained online retailer with risk aversion: coordinating strategy analysis. - Yi Tao 002; Ruisi Yang; Xiaopo Zhuo; Fan Wang 003; Xiao Yang (Ann. Oper. Res., 2023)