![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Zequn Wei
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c3]Yiting Wang, Yawen Li, Zequn Wei, Junqi Li:
Hybrid Evolutionary Algorithm for the Overlap Constrained Resource Allocation Problem in Wireless Networks. AINA (3) 2024: 245-256 - 2023
- [j7]Zequn Wei
, Jin-Kao Hao
, Jintong Ren, Fred W. Glover
:
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem. Eur. J. Oper. Res. 309(3): 993-1009 (2023) - [j6]Zequn Wei
, Jin-Kao Hao
:
Iterated hyperplane search for the budgeted maximum coverage problem. Expert Syst. Appl. 214: 119078 (2023) - 2021
- [j5]Zequn Wei
, Jin-Kao Hao:
Multistart solution-based tabu search for the Set-Union Knapsack Problem. Appl. Soft Comput. 105: 107260 (2021) - [j4]Zequn Wei
, Jin-Kao Hao:
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. Comput. Oper. Res. 136: 105447 (2021) - [j3]Zequn Wei
, Jin-Kao Hao:
Kernel based tabu search for the Set-union Knapsack Problem. Expert Syst. Appl. 165: 113802 (2021) - [j2]Liwen Li, Zequn Wei
, Jin-Kao Hao, Kun He:
Probability learning based tabu search for the budgeted maximum coverage problem. Expert Syst. Appl. 183: 115310 (2021) - [i3]Zequn Wei, Jin-Kao Hao:
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. CoRR abs/2101.04753 (2021) - 2020
- [i2]Liwen Li, Zequn Wei, Jin-Kao Hao, Kun He:
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem. CoRR abs/2007.05971 (2020)
2010 – 2019
- 2019
- [j1]Zequn Wei
, Jin-Kao Hao:
Iterated two-phase local search for the Set-Union Knapsack Problem. Future Gener. Comput. Syst. 101: 1005-1017 (2019) - [i1]Zequn Wei, Jin-Kao Hao:
Iterated two-phase local search for the Set-Union Knapsack Problem. CoRR abs/1903.04966 (2019) - 2017
- [c2]Bo Liang, Yuren Li, Zequn Wei, Yuqing Zhu, Wenjing Zhang:
Control analysis of inverter parallel system based on virtual synchronous generator. IECON 2017: 4116-4123 - [c1]Zequn Wei, Liang Bo, Yuren Li, Dong Min, Longfei Fu:
Study on the linear parameterization method for the peak friction coefficient of aircraft braking system. IECON 2017: 4176-4182
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint