A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice

H Bakker, F Dunke, S Nickel - Omega, 2020 - Elsevier
While methods for optimization under uncertainty have been studied intensely over the past
decades, the explicit consideration of the interplay between uncertainty and time has gained …

Global, regional, and national comparative risk assessment of 84 behavioural, environmental and occupational, and metabolic risks or clusters of risks for 195 …

JD Stanaway, A Afshin, E Gakidou, SS Lim, D Abate… - The Lancet, 2018 - thelancet.com
Summary Background The Global Burden of Diseases, Injuries, and Risk Factors Study
(GBD) 2017 comparative risk assessment (CRA) is a comprehensive approach to risk factor …

Speed is as powerful as clairvoyance

B Kalyanasundaram, K Pruhs - Journal of the ACM (JACM), 2000 - dl.acm.org
We introduce resource augmentation as a method for analyzing online scheduling
problems. In resource augmentation analysis the on-line scheduler is given more resources …

Online algorithms: a survey

S Albers - Mathematical Programming, 2003 - Springer
During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …

On-line algorithms

S Albers, S Leonardi - ACM Computing Surveys (CSUR), 1999 - dl.acm.org
Over the past twelve years, online algorithms have received considerable research interest.
Online problems had been investigated already in the seventies and early eighties but an …

Beyond competitive analysis

E Koutsoupias, CH Papadimitriou - SIAM Journal on Computing, 2000 - SIAM
The competitive analysis of online algorithms has been criticized as being too crude and
unrealistic. We propose refinements of competitive analysis in two directions: The first …

On the advice complexity of online problems

HJ Böckenhauer, D Komm, R Královič… - … and Computation: 20th …, 2009 - Springer
In this paper, we investigate to what extent the solution quality of online algorithms can be
improved by allowing the algorithm to extract a given amount of information about the input …

Speed is as powerful as clairvoyance [scheduling problems]

B Kalyanasundaram, K Pruhs - Proceedings of IEEE 36th …, 1995 - ieeexplore.ieee.org
We consider several well known nonclairvoyant scheduling problems, including the problem
of minimizing the average response time, and best-effort firm real-time scheduling. It is …

Generalized online routing: New competitive ratios, resource augmentation, and asymptotic analyses

P Jaillet, MR Wagner - Operations research, 2008 - pubsonline.informs.org
We consider online routing optimization problems where the objective is to minimize the
time needed to visit a set of locations under various constraints; the problems are online …

Optimization of scoring rules

Y Li, JD Hartline, L Shan, Y Wu - … of the 23rd ACM Conference on …, 2022 - dl.acm.org
This paper introduces an objective for optimizing proper scoring rules. The objective is to
maximize the increase in payoff of a forecaster who exerts a binary level of effort to refine a …