default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeikun Chen
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jiang-Yao Luo
, Liang Chen, Weikun Chen, Jian-Hua Yuan, Yu-Hong Dai:
A cut-and-solve algorithm for virtual machine consolidation problem. Future Gener. Comput. Syst. 154: 359-372 (2024)- [j14]Wei-Kun Chen, Zheyu Wu, Rui-Jin Zhang, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing. IEEE Trans. Signal Process. 72: 4935-4949 (2024) - [c7]Zheyu Wu, Wei-Kun Chen, Ya-Feng Liu, Christos Masouros:
CI-Based QoS-Constrained Transmit Signal Design for DFRC Systems with One-Bit DACs. SAM 2024: 1-5 - [i14]Zheyu Wu, Ya-Feng Liu, Wei-Kun Chen, Christos Masouros:
Quantized Constant-Envelope Waveform Design for Massive MIMO DFRC Systems. CoRR abs/2403.06185 (2024) - [i13]Mingjie Shao, Wei-Kun Chen, Cheng-Yang Yu, Ya-Feng Liu, Wing-Kin Ma:
One-Bit MIMO Detection: From Global Maximum-Likelihood Detector to Amplitude Retrieval Approach. CoRR abs/2407.11079 (2024) - [i12]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks. CoRR abs/2409.13943 (2024) - 2023
- [j13]Liang Chen, Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Tao Quan, Juan Chen:
Efficient presolving methods for solving maximal covering and partial set covering location problems. Eur. J. Oper. Res. 311(1): 73-87 (2023) - [j12]Wei-Kun Chen, Liang Chen, Yu-Hong Dai:
Lifting for the integer knapsack cover polyhedron. J. Glob. Optim. 86(1): 205-249 (2023) - [j11]Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Jian-Hua Yuan, Hou-Shan Zhang:
Efficient presolving methods for the influence maximization problem. Networks 82(3): 229-253 (2023) - [j10]Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - [j9]Weikun Chen, Ya-Feng Liu, Fan Liu, Yu-Hong Dai, Zhi-Quan Luo:
Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach. IEEE Trans. Signal Process. 71: 615-630 (2023) - [c6]Wei-Kun Chen, Ya-Feng Liu, Rui-Jin Zhang, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Decomposition Algorithm for Large-Scale Network Slicing. SPAWC 2023: 171-175 - [c5]Cheng-Yang Yu, Mingjie Shao, Wei-Kun Chen, Ya-Feng Liu, Wing-Kin Ma:
An Efficient Global Algorithm for One-Bit Maximum-Likelihood MIMO Detection. SPAWC 2023: 231-235 - [i11]Cheng-Yang Yu, Mingjie Shao, Wei-Kun Chen, Ya-Feng Liu, Wing-Kin Ma:
An Efficient Global Algorithm for One-Bit Maximum-Likelihood MIMO Detection. CoRR abs/2306.15167 (2023) - [i10]Wei-Kun Chen, Ya-Feng Liu, Rui-Jin Zhang, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Decomposition Algorithm for Large-Scale Network Slicing. CoRR abs/2306.15247 (2023) - 2022
- [j8]Peiqi Tang, Jianjun Li, Feifei Ding, Weikun Chen, Xinfu Li:
PSNet: change detection with prototype similarity. Vis. Comput. 38(11): 3541-3550 (2022) - [c4]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
Optimal Qos-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. ICASSP 2022: 5288-5292 - [i9]Zheyu Wu, Jiageng Wu, Wei-Kun Chen, Ya-Feng Liu:
Diversity Order Analysis for Quantized Constant Envelope Transmission. CoRR abs/2210.14543 (2022) - [i8]Jiang-Yao Luo, Liang Chen, Wei-Kun Chen, Jian-Hua Yuan, Yu-Hong Dai:
A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem. CoRR abs/2212.12341 (2022) - 2021
- [j7]Liang Chen, Weikun Chen, Mu-Ming Yang, Yu-Hong Dai:
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. J. Glob. Optim. 81(3): 659-689 (2021) - [j6]Ping-Fan Zhao, Qingna Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. SIAM J. Optim. 31(2): 1519-1545 (2021) - [j5]Weikun Chen, Ya-Feng Liu, Antonio De Domenico, Zhi-Quan Luo, Yu-Hong Dai:
Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency. IEEE Trans. Netw. Serv. Manag. 18(4): 4337-4352 (2021) - [c3]Weikun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem. ICASSP 2021: 4735-4739 - [i7]Weikun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem. CoRR abs/2102.02563 (2021) - [i6]Wei-Kun Chen, Ya-Feng Liu, Fan Liu, Yu-Hong Dai, Zhi-Quan Luo:
Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach. CoRR abs/2107.14404 (2021) - [i5]Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, Zhi-Quan Luo:
Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. CoRR abs/2110.03915 (2021) - 2020
- [j4]Weikun Chen, Ziliang Wei, Yueming Gao, Zeljka Lucev Vasic, Mario Cifrek, Mang I Vai, Min Du, Sio-Hang Pun:
Design of Galvanic Coupling Intra-Body Communication Transceiver Using Direct Sequence Spread Spectrum Technology. IEEE Access 8: 84123-84133 (2020) - [j3]Patrick Gemander, Weikun Chen, Dieter Weninger, Leona Gottwald, Ambros M. Gleixner, Alexander Martin:
Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO J. Comput. Optim. 8(3): 205-240 (2020) - [c2]Ziliang Wei, Weikun Chen, Ming-jing Yang, Yue-ming Gao, Zeljka Lucev Vasic, Mario Cifrek:
Design and Implementation of Galvanic Coupling Intra-Body Communication Transceivers using Differential Phase Shift Keying. I2MTC 2020: 1-6 - [c1]Weikun Chen, Ya-Feng Liu, Antonio De Domenico, Zhi-Quan Luo:
Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency. SPAWC 2020: 1-5 - [i4]Weikun Chen, Ya-Feng Liu, Antonio De Domenico, Zhi-Quan Luo:
Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency. CoRR abs/2002.07380 (2020) - [i3]Ping-Fan Zhao, Qing-Na Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. CoRR abs/2006.12123 (2020) - [i2]Weikun Chen, Ya-Feng Liu, Antonio De Domenico, Zhi-Quan Luo, Yu-Hong Dai:
Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency. CoRR abs/2006.13019 (2020)
2010 – 2019
- 2019
- [j2]Zehua Guo, Weikun Chen, Ya-Feng Liu, Yang Xu, Zhi-Li Zhang:
Joint Switch Upgrade and Controller Deployment in Hybrid Software-Defined Networks. IEEE J. Sel. Areas Commun. 37(5): 1012-1028 (2019) - [i1]Zehua Guo, Weikun Chen, Ya-Feng Liu, Yang Xu, Zhi-Li Zhang:
Joint Switch Upgrade and Controller Deployment in Hybrid Software-Defined Networks. CoRR abs/1903.09369 (2019) - 2018
- [j1]Weikun Chen, Liang Chen, Mu-Ming Yang, Yu-Hong Dai:
Generalized coefficient strengthening cuts for mixed integer programming. J. Glob. Optim. 70(1): 289-306 (2018)
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-01-20 22:57 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:
