Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Georg Kliewer"'
Autor:
Hagen M. Gegner, Thomas Naake, Aurélien Dugourd, Torsten Müller, Felix Czernilofsky, Georg Kliewer, Evelyn Jäger, Barbara Helm, Nina Kunze-Rohrbach, Ursula Klingmüller, Carsten Hopf, Carsten Müller-Tidow, Sascha Dietrich, Julio Saez-Rodriguez, Wolfgang Huber, Rüdiger Hell, Gernot Poschet, Jeroen Krijgsveld
Publikováno v:
Frontiers in Molecular Biosciences, Vol 9 (2022)
Metabolomic and proteomic analyses of human plasma and serum samples harbor the power to advance our understanding of disease biology. Pre-analytical factors may contribute to variability and bias in the detection of analytes, especially when multipl
Externí odkaz:
https://doaj.org/article/13786df52f9646db9487239e968656a6
Publikováno v:
Journal of mass spectrometry : JMSREFERENCES. 55(3)
Automated matrix deposition for matrix-assisted laser desorption/ionization (MALDI) mass spectrometry imaging (MSI) is crucial for producing reproducible analyte ion signals. Here we report an innovative method employing an automated immersion appara
Publikováno v:
Journal of Revenue and Pricing Management. 2:120-137
This paper examines systems integration for revenue creating control processes (RCCP) in the airline industry, which is of significance for enhanced control of revenue and cost quantities. More specifically, the paper gives an overview of the airline
Autor:
Georg Kliewer, Yvonne Bleischwitz
Publikováno v:
Experimental and Efficient Algorithms ISBN: 9783540259206
WEA
WEA
Among all the variations of general combinatorial auctions, the Vickrey auction is essentially the only incentive-compatible auction. Furthermore, it is individual rational and weakly budget-balanced. In many cases these properties are very desirable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a884d8b19cc60f73ff8af556bde82337
https://doi.org/10.1007/11427186_21
https://doi.org/10.1007/11427186_21
Autor:
Georg Kliewer, Larissa Timajev
Publikováno v:
Algorithms – ESA 2005 ISBN: 9783540291183
ESA
ESA
We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a99265037809bb2a776a74afa278fb54
https://doi.org/10.1007/11561071_7
https://doi.org/10.1007/11561071_7
Publikováno v:
Algorithms — ESA 2002 ISBN: 9783540441809
ESA
ESA
We present a branch-and-bound approach for the Capacitated Network Design Problem. We focus on tightening strategies such as variable fixing and local cuts that can be applied in every search node. Different variable fixing algorithms based on Lagran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10411a6b337f0210f28bf5b4db958a96
https://doi.org/10.1007/3-540-45749-6_73
https://doi.org/10.1007/3-540-45749-6_73
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.