The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the...

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

We consider a problem where customers dynamically request next-day home service, e.g., repair or instalment. Unlike attended home delivery, customers cannot select a time window (TW), but the service provider assigns a next-day TW to each new customer if the customer can feasibly be inserted in...

With the current advances in aircraft design and Lithium-Ion batteries, electric aircraft are expected to serve as a replacement for conventional, short-range aircraft. This paper addresses the main operational challenges for short-range flights operated with electric aircraft: determining the...

This paper develops an approximate closed-form optimal portfolio allocation formula for a spot asset whose variance follows a GARCH(1,1) process. We consider an investor with constant relative risk aversion (CRRA) utility who wants to maximize the expected utility from terminal wealth under a...

A stochastic difference game is considered in which a player wants to minimize the time spent by a controlled one-dimensional symmetric random walk {𝑋𝑛,𝑛=0,1,…} in the continuation region 𝐶:={1,2,…}, and the second player seeks to maximize the survival time in C. The process...