Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Pu, Shanwen"'
Integer programming with block structures has received considerable attention recently and is widely used in many practical applications such as train timetabling and vehicle routing problems. It is known to be NP-hard due to the presence of integer
Externí odkaz:
http://arxiv.org/abs/2406.19605
Linear programming has been practically solved mainly by simplex and interior point methods. Compared with the weakly polynomial complexity obtained by the interior point methods, the existence of strongly polynomial bounds for the length of the pivo
Externí odkaz:
http://arxiv.org/abs/2308.08171
Motivated by the emerging needs of personalized preventative intervention in many healthcare applications, we consider a multi-stage, dynamic decision-making problem in the online setting with unknown model parameters. To deal with the pervasive issu
Externí odkaz:
http://arxiv.org/abs/2211.08998
Publikováno v:
In High-Confidence Computing March 2023 3(1)
Publikováno v:
IEEE transactions on pattern analysis and machine intelligence [IEEE Trans Pattern Anal Mach Intell] 2024 Dec; Vol. 46 (12), pp. 9439-9455. Date of Electronic Publication: 2024 Nov 06.