Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Wei-Kun Chen"'
Publikováno v:
IEEE Open Journal of Signal Processing, Vol 4, Pp 21-30 (2023)
Quantized constant envelope (QCE) transmission is a popular and effective technique to reduce the hardware cost and improve the power efficiency of 5G and beyond systems equipped with large antenna arrays. It has been widely observed that the number
Externí odkaz:
https://doaj.org/article/e74c620202fb4de88f4b018cf24aa4cd
Autor:
Patrick Gemander, Wei-Kun Chen, Dieter Weninger, Leona Gottwald, Ambros Gleixner, Alexander Martin
Publikováno v:
EURO Journal on Computational Optimization, Vol 8, Iss 3, Pp 205-240 (2020)
In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase. Despite their mathematical simplici
Externí odkaz:
https://doaj.org/article/87aae383cabe4346ba569049661df2fd
Autor:
Wei-Kun Chen, 程偉堃
99
The main purpose of this study is to develop the trivalent chromium conversion coatings with excellent anticorrosive performance on aluminum alloys at room temperature. To identify the formation mechanism of trivalent chromium conversion coat
The main purpose of this study is to develop the trivalent chromium conversion coatings with excellent anticorrosive performance on aluminum alloys at room temperature. To identify the formation mechanism of trivalent chromium conversion coat
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/45675065694208991081
Publikováno v:
Journal of Global Optimization. 86:205-249
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f96c29dcc03a90e8ecf25d6137567c0
https://doi.org/10.1007/s10898-022-01252-x
https://doi.org/10.1007/s10898-022-01252-x
Autor:
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco 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
Publikováno v:
ACM Transactions on Mathematical Software.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this paper is on the role of the SCIP Optimization Suite in supporti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::578d0e2e73fb9ca5703e6f8eacf8b413
https://doi.org/10.1145/3585516
https://doi.org/10.1145/3585516
Publikováno v:
Nuclear Science and Techniques. 33
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::965c5892509e6c813857b1407b18b996
https://doi.org/10.1007/s41365-022-01123-w
https://doi.org/10.1007/s41365-022-01123-w
Publikováno v:
Journal of Global Optimization. 81:659-689
In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-set polyhedron of the considered problem as a substructure and generate cutting planes by solving the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b612b0142f60505d1656a7ebdc1aa297
https://doi.org/10.1007/s10898-020-00967-z
https://doi.org/10.1007/s10898-020-00967-z
Autor:
Wei-Kun Chen, Yu-Hong Dai
Publikováno v:
Science China Mathematics. 64:211-220
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover inequality can be computed in polynomial time for a given minimal cove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4541bf9ce65f347e6ca59517c291babe
https://doi.org/10.1007/s11425-019-9538-1
https://doi.org/10.1007/s11425-019-9538-1
Publikováno v:
ICASSP
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::889a574da56e3bb83e1c2e059b338a91
In this paper, we propose an efficient algorithm for the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to mee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91aed788a205cf0c700b52a1e2e53cd3