We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
In this paper we address the problem of designing energy minimizing collision-free maneuvers for multiple agents moving on a plane. We show that the problem is equivalent to that o...
Jianghai Hu, Maria Prandini, Karl Henrik Johansson...
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...