3 citations · 3 across the 4 of their papers we have counts for
4 papers
Bicriteria Nash Flows over Time
Tim Oosterwijk, Daniel Schmand, Marc Schröder
Flows over time are a natural way to incorporate flow dynamics that arise in various applications such as traffic networks. In this paper we introduce a natural variant of the dete…
The Secretary Problem with Independent Sampling
José Correa, Andrés Cristi, Laurent Feuilloley +2
In the secretary problem we are faced with an online sequence of elements with values. Upon seeing an element we have to make an irrevocable take-it-or-leave-it decision. The goal…
On local search and LP and SDP relaxations for k-Set Packing
Tim Oosterwijk
Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching a…
High Multiplicity Scheduling with Switching Costs for few Products
Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen +1
We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and…