In many situations we try to solve optimization problems where data structures with totally ordered objects like stacks, queues, or lists are used to describe the situation. When formulating a mathematical MIP--model, we often see formulations where a single decision variable describes what entity is located at what position within the object. Such formulations allow easy access to the components of the objects but require a large number of (integer) decision variables.
In this presentation we will discuss a different modeling idea. Using as an example the Block Relocation Problem, which is an established problem in container logistics, we describe in detail how to model stacks in a non-standard fashion. The presented idea may also be applied in other settings.
Date: Monday 12th November, 2018 (starting at 14:00)
Location: Z536 (City center)