Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sofie Coene"'
Autor:
Jens Van Praet, Kris Van De Moortele, Patrick Descheemaeker, Ann Sofie Coene, Marijke Reynders
Publikováno v:
Infection
A subset of patients with Covid-19 presents with negative RT-PCR screening but suspect CT findings. Using four commercially available anti-SARS-CoV-2 IgG immuno-assays, we found this subset constituted 9.2% of all consecutively admitted outpatients w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3fb3ed0bd115775a4ec11a6a3dd76bb
https://pubmed.ncbi.nlm.nih.gov/32910322
https://pubmed.ncbi.nlm.nih.gov/32910322
Publikováno v:
INFECTION CONTROL AND HOSPITAL EPIDEMIOLOGY
Infection Control and Hospital Epidemiology
Infection Control & Hospital Epidemiology
Infection Control and Hospital Epidemiology
Infection Control & Hospital Epidemiology
ispartof: INFECTION CONTROL AND HOSPITAL EPIDEMIOLOGY vol:41 issue:11 pages:1355-1356 ispartof: location:United States status: published
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15f3fb8d9a8caedf0e1349969b751618
https://hdl.handle.net/1854/LU-8680306
https://hdl.handle.net/1854/LU-8680306
Autor:
Greet Van den Berghe, Sofie Coene, Johann L. Hurink, Frits C. R. Spieksma, Ward Passchyn, Dirk Briskorn
Publikováno v:
European journal of operational research, 251(2), 432-441. Elsevier
Inland waterways form a natural network infrastructure with capacity for more traffic. Transportation by ship is widely promoted as it is a reliable, efficient and environmental friendly way of transport. Nevertheless, locks managing the water level
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a3846b05ad42ede6de10410030f7a8f
http://eprints.eemcs.utwente.nl/secure2/26990/01/EJOR-final.pdf
http://eprints.eemcs.utwente.nl/secure2/26990/01/EJOR-final.pdf
Publikováno v:
European journal of operational research
European Journal of Operational Research, 224(3), 458-465. Elsevier
European Journal of Operational Research, 224(3), 458-465. Elsevier
The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. In this paper, we propose a linear integer programming formulation and two solution approaches f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db4e5b792e0c9fc54204b2d865555a22
https://doi.org/10.1016/j.ejor.2012.09.005
https://doi.org/10.1016/j.ejor.2012.09.005
Publikováno v:
INFOR: Information Systems and Operational Research. 50:88-94
We revisit the peer-to-peer on-orbit satellite refueling problem, in which the maneuvering satellites are allowed to interchange their orbital positions. We show that the problem is computationally hard by reducing it to a special case of the three-i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97d725dc5718307c73b1ca11bf2a23cf
https://doi.org/10.3138/infor.50.2.088
https://doi.org/10.3138/infor.50.2.088
Publikováno v:
Journal of the Operational Research Society. 61:1719-1728
This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e469a4a7827165023902b14bfad708c5
https://doi.org/10.1057/jors.2009.154
https://doi.org/10.1057/jors.2009.154
Autor:
Sofie Coene, Frits C. R. Spieksma
Publikováno v:
Operations Research Letters. 36:333-337
The latency problem with profits is a generalization of the minimum latency problem. In this generalization it is not necessary to visit all clients, however, visiting a client may bring a certain revenue. More precisely, in the latency problem with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f1f03c0abcada125f12148695218e1c
https://doi.org/10.1016/j.orl.2007.11.001
https://doi.org/10.1016/j.orl.2007.11.001
We consider a rooted tree graph with costs associated with the edges and profits associated with the vertices. Every subtree containing the root incurs the sum of the costs of its edges, and collects the sum of the profits of its nodes; the goal is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2dec65ff39eb6c081563ec055fd2a9b0
http://hdl.handle.net/11379/164629
http://hdl.handle.net/11379/164629
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3b9ab82b8b7321a7d2426446e57d9f8
https://doi.org/10.2139/ssrn.1974493
https://doi.org/10.2139/ssrn.1974493
Publikováno v:
SSRN Electronic Journal.
We revisit the peer-to-peer refueling problem, in which the maneuvering satellites are allowed to interchange their orbital positions [2]. We show that the problem is computationally hard, by reducing it to a special case of the three-index assignmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bd7baf1c041590aeba62d93ad44f08a
https://doi.org/10.2139/ssrn.1551249
https://doi.org/10.2139/ssrn.1551249