default search action
Fan Wang 0003
Person information
- affiliation: Sun-Yat Sen University, School of Business, Guangzhou, China
- affiliation (former): Hong Kong University of Science and Technology, Department of Industrial Engineering and Engineering Management, Hong Kong
- affiliation (PhD 2002): Tsinghua University, Department of Computer Science and Technology, Beijing, China
Other persons with the same name
- Fan Wang — disambiguation page
- Fan Wang 0001 — University of Arizona, Tucson, USA
- Fan Wang 0002 — INSA de Rouen, France
- Fan Wang 0004 — Ohio State University, Department of Computer Science and Engineering, Columbus, OH, USA
- Fan Wang 0005
— Xidian University, School of Electronic Engineering, Remote Sensing Image Processing and Fusion Group, Xi'an, China
- Fan Wang 0006
- Fan Wang 0007
- Fan Wang 0008
- Fan Wang 0009
- Fan Wang 0010
- Fan Wang 0011
- Fan Wang 0012
- Fan Wang 0013
- Fan Wang 0014
- Fan Wang 0015
- Fan Wang 0016
- Fan Wang 0017
- Fan Wang 0018
- Fan Wang 0019
- Fan Wang 0020
- Fan Wang 0021
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Yi Tao, Ruisi Yang, Xiaopo Zhuo
Financing the capital-constrained online retailer with risk aversion: coordinating strategy analysis. Ann. Oper. Res. 331(1): 321-349 (2023) - 2021
- [j20]Xiaopo Zhuo, Fan Wang, Shaorui Zhou
Pricing and Cargo Canvassing with Risk-Sensitive Shipping Lines: A Mean-Risk Analysis. Asia Pac. J. Oper. Res. 38(4): 2050054:1-2050054:31 (2021) - 2020
- [j19]Shaorui Zhou
A new convergent hybrid learning algorithm for two-stage stochastic programs. Eur. J. Oper. Res. 283(1): 33-46 (2020) - [j18]Fan Wang
An AI Model for Oil Volatility Forecasting. IEEE Intell. Syst. 35(3): 62-70 (2020)
2010 – 2019
- 2017
- [j17]Weiwei Zhang, Zhongfei Li
Effect of the Return Policy in a Continuous-Time Newsvendor Problem. Asia Pac. J. Oper. Res. 34(6): 1750031:1-1750031:28 (2017) - 2016
- [j16]A. Chunxiang, Zhongfei Li, Fan Wang
Optimal investment strategy under time-inconsistent preferences and high-water mark contract. Oper. Res. Lett. 44(2): 212-218 (2016) - 2015
- [j15]Yi Tao, Fan Wang
An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput. Oper. Res. 55: 127-140 (2015) - 2014
- [j14]Zhou Xu
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. Networks 63(2): 179-195 (2014) - [c20]Jinjia Huang, Fan Wang
Resource Allocation Problems in Port Operations: A Literature Review. CSO 2014: 154-158 - 2013
- [j13]Fan Wang
Group-to-group reviewer assignment problem. Comput. Oper. Res. 40(5): 1351-1362 (2013) - [j12]Fan Wang
Metaheuristics for robust graph coloring. J. Heuristics 19(4): 529-548 (2013) - 2011
- [j11]Fan Wang
A multi-objective optimization for green supply chain network design. Decis. Support Syst. 51(2): 262-269 (2011) - 2010
- [j10]Fan Wang
A Comprehensive Survey of the Reviewer Assignment Problem. Int. J. Inf. Technol. Decis. Mak. 9(4): 645-668 (2010) - [c19]Yi Tao, Fan Wang
A new packing heuristic based algorithm for Vehicle Routing Problem with Three-dimensional Loading constraints. CASE 2010: 972-977
2000 – 2009
- 2009
- [j9]Yanzhi Li
A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning. Eur. J. Oper. Res. 199(2): 553-560 (2009) - [c18]Fan Wang
A Survey on Vehicle Routing Problem with Loading Constraints. CSO (2) 2009: 602-606 - 2008
- [j8]Andrew Lim
The bidding selection and assignment problem with minimum quantity commitment. J. Oper. Res. Soc. 59(5): 693-702 (2008) - [j7]Fan Wang
Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem. IEEE Trans Autom. Sci. Eng. 5(2): 289-297 (2008) - [c17]Xiaoyu Zhang, Fan Wang
On scheduling concurrent multicast sessions over resource reserved network. ICON 2008: 1-6 - [c16]Zhaowei Miao, Ke Fu, Qi Fei, Fan Wang
Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules. IEA/AIE 2008: 601-610 - [c15]Fan Wang
A Survey on Reviewer Assignment Problem. IEA/AIE 2008: 718-727 - 2007
- [j6]Fan Wang
A stochastic beam search for the berth allocation problem. Decis. Support Syst. 42(4): 2186-2196 (2007) - [c14]Yanzhi Li, Yi Tao, Fan Wang:
A Compromised Large-Scale Neighborhood Search Heuristic for Cargo Loading Planning. Australian Conference on Artificial Intelligence 2007: 721-726 - 2006
- [j5]Fan Wang
The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48(1): 24-35 (2006) - [j4]Andrew Lim
A Transportation Problem with Minimum Quantity Commitment. Transp. Sci. 40(1): 117-129 (2006) - 2005
- [j3]Andrew Lim
Multi-depot vehicle routing problem: a one-stage approach. IEEE Trans Autom. Sci. Eng. 2(4): 397-402 (2005) - [j2]Andrew Lim
k-Center problems with minimum coverage. Theor. Comput. Sci. 332(1-3): 1-17 (2005) - [c13]Andrew Lim, Fan Wang:
Robust Graph Coloring for Uncertain Supply Chain Management. HICSS 2005 - [c12]Andrew Lim
Robust Airport Gate Assignment. ICTAI 2005: 74-81 - [c11]Andrew Lim
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. ISAAC 2005: 1061-1070 - [c10]Songshan Guo, Weixing Li, Andrew Lim
The shortest route cut and fill problem in linear topological structure. SAC 2005: 409-410 - 2004
- [j1]Yanzhi Li, Fan Wang
A genetic algorithm for machine scheduling problem under shared resource constraints. Int. J. Comput. Appl. Technol. 19(2): 77-83 (2004) - [c9]Songshan Guo, Ying Kong, Andrew Lim, Fan Wang:
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem. Australian Conference on Artificial Intelligence 2004: 636-645 - [c8]Andrew Lim, Fan Wang, Zhou Xu:
On the Selection and Assignment with Minimum Quantity Commitments. COCOON 2004: 102-111 - [c7]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center Problems with Minimum Coverage. COCOON 2004: 349-359 - [c6]Fan Wang, Andrew Lim, Hong Chen:
Flexible Demand Assignment Problem. ECAI 2004: 698-704 - [c5]Andrew Lim
Meta-Heuristics for Robust Graph Coloring Problem. ICTAI 2004: 514-518 - [c4]Andrew Lim
A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. ICTAI 2004: 704-708 - [c3]Zhiye Li, Songshan Guo, Fan Wang, Andrew Lim:
Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles. IEA/AIE 2004: 552-561 - 2003
- [c2]Ying Kong, Fan Wang, Andrew Lim, Songshan Guo:
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. Australian Conference on Artificial Intelligence 2003: 125-136 - [c1]Yanzhi Li
Resource constraints machine scheduling: a genetic algorithm approach. IEEE Congress on Evolutionary Computation 2003: 1080-1085
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-02-04 21:01 CET 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: