In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job’s location at one point in time followed by the...

In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job’s location at one point in time followed by the...

This paper describes five sets of 33 Mixed Integer Problem instances each, for a total of 165 instances, derived from a real-world full-truckload pick-up and delivery problem with time windows at the Port of Rotterdam. These instances represent 33 individual days of data encompassing 65 jobs and...

This paper describes five sets of 33 Mixed Integer Problem instances each, for a total of 165 instances, derived from a real-world full-truckload pick-up and delivery problem with time windows at the Port of Rotterdam. These instances represent 33 individual days of data encompassing 65 jobs and...

We conduct a survey experiment on the effect of information provision on attitudes towards immigration in Germany. The focus lies on two theory-based economic channels, labor market and welfare state concerns, and immigration policy preferences. Using probability-based representative survey...