Related papers: The Temp Secretary Problem
University timetabling (UTT) is a complex problem due to its combinatorial nature but also the type of constraints involved. The holy grail of (constraint) programming: "the user states the problem the program solves it" remains a challenge…
We present a systematic study of the statistics of the occupation time and related random variables for stochastic processes with independent intervals of time. According to the nature of the distribution of time intervals, the probability…
In bilateral accounting of resource consumption both the consumer and provider independently measure the amount of resources consumed by the consumer. The problem here is that potential disparities between the provider's and consumer's…
Unit disk graphs are the set of graphs which represent the intersection of disk graphs and interval graphs. These graphs are of great importance due to their structural similarity with wireless communication networks. Firefighter problem on…
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a text. This task raises the problem of comparing two…
This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a…
We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of…
The game of best choice (also known as the secretary problem) is a model for sequential decision making with a long history and many variations. The classical setup assumes that the sequence of candidate rankings are uniformly distributed.…
Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the…
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may…
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based…
This article discusses the algorithms for finding the optimal solution of problems related to the location of temporary storage of goods, warehouses, factories for processing raw materials and shops selling the final product in the…
For extracting meaningful topics from texts, their structures should be considered properly. In this paper, we aim to analyze structured time-series documents such as a collection of news articles and a series of scientific papers, wherein…
Polling systems with losses are useful mathematical objects that can model many practical systems like travelling salesman problem with recurrent requests. One of the less studied yet an important aspect in such systems is the disparity in…
For $2\le k\in\mathbb{N}$, consider the following adaptation of the classical secretary problem. There are $k$ items at each of $n$ linearly ordered ranks. The $kn$ items are revealed, one item at a time, in a uniformly random order, to an…
In many real-world settings, problem instances that need to be solved are quite similar, and knowledge from previous optimization runs can potentially be utilized. We explore this for the Traveling Salesperson problem with time windows…
Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click…
In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…
In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions on each node. These additional constraints limit the…
This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of…