Reduce, Reuse, Recycle: On exploration of solution reuse in VRPTW

Solving routing problems efficiently is instrumental in minimizing operational costs in logistics. These routing problems are hard to solve and often take a lot of time to find a good solution. In this thesis, we present a methodology that tackles the challenge of efficiently solving recurring instances of the Vehicle Routing Problem with Time...

A Quantum Annealing Approach for Solving Hard Variants of the Stable Marriage Problem

The Stable Marriage Problem (SMP) describes the problem, of finding a stable matching between two equally sized sets of elements (e.g., males and females) given an ordering of preferences for each element. A matching is stable, when there does not exist any match of a male and female which both prefer each other to their current partner under...

Optimization of the Locations of Virtual Network Functions

In traditional networks, the network functions are implemented as physical appliances which are called middleboxes and these middleboxes need to be deployed in predetermined locations throughout the network. Therefore one of the most important disadvantages of using middleboxes is that each network function deployment requires a great deal of...