We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding in O(T³) time. The algorithm is based on the standard dynamic programming approach which requires the computation of the minimal costs for all possible...

In this paper we will describe a Multi-Agent System which iscapable of finding a feasible solution of a specially structuredlinear programming problem. Emphasis is given to correctnessissues and termination detection.

In this paper we simultaneously consider three extensions to the standard Orienteering Problem (OP) to model characteristics that are of practical relevance in planning reconnaissance missions of Unmanned Aerial Vehicles (UAVs). First, travel and recording times are uncertain. Secondly, the...