Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …
(2004), knapsack problems became a classical and rich research area in combinatorial …
Learning-augmented query policies for minimum spanning tree with uncertainty
We study how to utilize (possibly erroneous) predictions in a model for computing under
uncertainty in which an algorithm can query unknown data. Our aim is to minimize the …
uncertainty in which an algorithm can query unknown data. Our aim is to minimize the …
Explorable uncertainty in scheduling with non-uniform testing times
The problem of scheduling with testing in the framework of explorable uncertainty models
environments where some preliminary action can influence the duration of a task. In the …
environments where some preliminary action can influence the duration of a task. In the …
An adversarial model for scheduling with testing
We introduce a novel adversarial model for scheduling with explorable uncertainty. In this
model, the processing time of a job can potentially be reduced (by an a priori unknown …
model, the processing time of a job can potentially be reduced (by an a priori unknown …
[PDF][PDF] Time-Constrained Participatory Budgeting Under Uncertain Project Costs.
In participatory budgeting the stakeholders collectively decide which projects from a set of
proposed projects should be implemented. This decision underlies both time and monetary …
proposed projects should be implemented. This decision underlies both time and monetary …
Scheduling with explorable uncertainty
We introduce a novel model for scheduling with explorable uncertainty. In this model, the
processing time of a job can potentially be reduced (by an a priori unknown amount) by …
processing time of a job can potentially be reduced (by an a priori unknown amount) by …
Randomization helps computing a minimum spanning tree under uncertainty
Given a graph with “uncertainty intervals” on the edges, we want to identify a minimum
spanning tree by querying some edges for their exact edge weights which lie in the given …
spanning tree by querying some edges for their exact edge weights which lie in the given …
Scheduling with testing on multiple identical parallel machines
Scheduling with testing is a recent online problem within the framework of explorable
uncertainty motivated by environments where some preliminary action can influence the …
uncertainty motivated by environments where some preliminary action can influence the …
Query-competitive sorting with uncertainty
We study the problem of sorting under incomplete information, when queries are used to
resolve uncertainties. Each of n data items has an unknown value, which is known to lie in a …
resolve uncertainties. Each of n data items has an unknown value, which is known to lie in a …
Sorting and hypergraph orientation under uncertainty with predictions
Learning-augmented algorithms have been attracting increasing interest, but have only
recently been considered in the setting of explorable uncertainty where precise values of …
recently been considered in the setting of explorable uncertainty where precise values of …