In this paper we analyze a new location problem which is a generalization of the well-known single facility location model. This extension consists of introducing a general objective function and replacing fixed locations by trajectories. We prove that the problem is well-stated and solvable. A...

In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation...

Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions of Multiobjective Linear Programmes (MOLPs). However, all of them are based on active-set methods (simplex-like approaches). We present a different method, based on a transformation of any...

Ausgehend von kontinuierlichen 1-Standortproblemen wird in diesem Paper eine neue Klasse von kostenbasierten TU-Spielen eingeführt. Es werden einige hinreichende Bedingungen präsentiert unter denen ein Spiel in dieser Klasse einen nicht-leeren Kern hat. Weiterhin werden Zuordnungsregeln für...

In this paper we consider the general question in the field of mathematics of whether some properties or algorithms that hold in finite dimension spaces also hold in function spaces. We answer this question concerning the very well-known Weiszfeld algorithm for the Weber problem. In order to do...

We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network operators. The players are represented by paths in the network. They have to decide how much flow...