We consider convex optimization problems formulated using dynamic programing equations. Such problems can be solved using the Dual Dynamic Programing algorithm combined with the Level 1 cut selection strategy or the Territory ...

We consider risk-averse formulations of stochastic linear programs having a structure that is common in real-life applications. Specifically, the optimization problem corresponds to controlling over a certain horizon a ...

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have ...

This letter proposes a method for 3-D semiautomatic road extraction from a single image by dynamic programming (DP), which requires a form of relief representation such as digital terrain model. Unlike traditional DP ...

There are efficient dynamic programming solutions to the computation of the Edit Distance from S ∈in [1..σ]n to T ∈in [1..σ]m, for many natural subsets of edit operations, typically in time within O(nm) in the worst-case ...

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction ...