Остановите войну!
for scientists:
default search action
Zuren Feng
- > Home > Persons > Zuren Feng
Publications
- 2020
- [j54]Ke Shang, Felix T. S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke:
Two-Stage Robust Optimization for the Orienteering Problem with Stochastic Weights. Complex. 2020: 5649821:1-5649821:15 (2020) - 2016
- [j38]Ke Shang, Zuren Feng, Liangjun Ke, Felix T. S. Chan:
Comprehensive Pareto Efficiency in robust counterpart optimization. Comput. Chem. Eng. 94: 75-91 (2016) - [c22]Zhenbao Liu, Zuren Feng, Liangjun Ke:
A Modified Fireworks Algorithm for the Multi-resource Range Scheduling Problem. ICSI (1) 2016: 535-543 - 2015
- [c21]Zhenbao Liu, Zuren Feng, Liangjun Ke:
Fireworks algorithm for the multi-satellite control resource scheduling problem. CEC 2015: 1280-1286 - [c20]Ke Shang, Liangjun Ke, Zuren Feng, Stephen Karungaru:
An Event-Driven Based Multiple Scenario Approach for Dynamic and Uncertain UAV Mission Planning. ICSI (2) 2015: 308-316 - 2014
- [c19]Ke Shang, Stephen Karungaru, Zuren Feng, Liangjun Ke, Kenji Terada:
A GA-ACO hybrid algorithm for the multi-UAV mission planning problem. ISCIT 2014: 243-248 - 2013
- [j27]Liangjun Ke, Zuren Feng:
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 40(2): 633-638 (2013) - [j26]Liangjun Ke, Zongben Xu, Zuren Feng, Ke Shang, Xueming Qian:
Proportion-based robust optimization and team orienteering problem with interval data. Eur. J. Oper. Res. 226(1): 19-31 (2013) - 2011
- [j22]Kailiang Xu, Zuren Feng, Liangjun Ke:
Single machine scheduling with total tardiness criterion and convex controllable processing times. Ann. Oper. Res. 186(1): 383-391 (2011) - [j21]Na Zhang, Zuren Feng, Liangjun Ke:
Guidance-solution based ant colony optimization for satellite control resource scheduling problem. Appl. Intell. 35(3): 436-444 (2011) - 2010
- [j19]Kailiang Xu, Zuren Feng, Liangjun Ke:
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Ann. Oper. Res. 181(1): 303-324 (2010) - [j18]Zhi-Gang Ren, Zu-ren Feng, Liangjun Ke, Zhao-Jun Zhang:
New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 58(4): 774-784 (2010) - [j15]Liangjun Ke, Zuren Feng, Zhigang Ren, Xiaoliang Wei:
An ant colony optimization approach for the multidimensional knapsack problem. J. Heuristics 16(1): 65-83 (2010) - [c14]Na Zhang, Zuren Feng, Liangjun Ke:
New pheromone trail updating method of ACO for satellite control resource scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-6 - 2009
- [c6]Qingsong Song, Zuren Feng, Liangjun Ke, Min Li:
Echo State Network for Abrupt Change Detections in Non-stationary Signals. ISDA 2009: 226-231 - 2008
- [j12]Liangjun Ke, Claudia Archetti, Zuren Feng:
Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3): 648-665 (2008) - [j7]Liangjun Ke, Zuren Feng, Zhigang Ren:
An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognit. Lett. 29(9): 1351-1357 (2008) - [c4]Zhigang Ren, Zuren Feng, Liangjun Ke, Hong Chang:
A fast and efficient ant colony optimization approach for the set covering problem. IEEE Congress on Evolutionary Computation 2008: 1839-1844
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 2024-04-08 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint