Abstract Tailored Mixed-Integer Optimal Control policies for real-world applications usually
have to avoid very short successive changes of the active integer control. Minimum dwell …

We investigate an extension of Mixed-Integer Optimal Control Problems by adding switching
costs, which enables the penalization of chattering and extends current modeling …

We propose a trust-region method that solves a sequence of linear integer programs to
tackle integer optimal control problems regularized with a total variation penalty. The total …

We present a branch-and-bound algorithm for globally solving parabolic optimal control
problems with binary switches that have bounded variation and possibly need to satisfy …

Partial outer convexification is a relaxation technique for MIOCPs being constrained by time-
dependent differential equations. Sum-Up-Rounding algorithms allow to approximate …

In this article, we present a unified framework for the numerical solution of optimal control
problems (OCPs) constrained by ordinary differential equations with both implicit and explicit …

Partial outer convexification has been used to derive relaxations of mixed-integer optimal
control problems (MIOCPs) that are constrained by time-dependent differential equations …

This article investigates a class of Mixed-Integer Optimal Control Problems (MIOCPs) with
switching costs. We introduce the problem class of Minimal-Switching-Cost Optimal Control …

We consider optimal control problems for partial differential equations where the controls
take binary values but vary over the time horizon; they can thus be seen as dynamic …

The convergence analysis for methods solving partial differential equations constrained
optimal control problems containing both discrete and continuous control decisions based …