The problem of fair zone design for local public transportation networks is considered. A network model which was introduced by Hamacher and Schöbel in [2] is investigated. We present theoretical results for special transportation networks and heuristic algorithms for the general problem....

Thek-partitioning problem is defined as follows: Given a set of items {I <Subscript>1</Subscript>,I <Subscript>2</Subscript>,...,I <Subscript>n</Subscript>} where itemIj is of weightwj ≥ 0, find a partitionS <Subscript>1</Subscript>,S <Subscript>2</Subscript>,...,S <Subscript> m </Subscript> of this set with ¦S <Subscript> i </Subscript>¦ =k such that the maximum weight of all subsetsS <Subscript> i </Subscript> is minimal,k-partitioning is strongly related to the...</subscript></subscript></subscript></subscript></subscript></subscript></subscript></subscript>

This paper presents a new approach for trajectory planning of air vehicles. It considers scenarios with risk areas and forbidden zones and takes into account the maneuverability of the air vehicle. It is flexible as to allow different kinds of objective functions such as minimizing risk, flight...