This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists in finding a spanning tree that minimizes...

Manpower still is one of the most expansive resources, in spite of increasing automation. While employee scheduling and rostering has been the topic of extensive research over the past decades, usually it is assumed that the demand for staff is either given or can be obtained without difficulty....

Effectiveness in the use of the work force is often the crucial advantage in a company's long-term success over its competitors, especially in technology driven and highly competitive branches as the one considered in this article. While employee scheduling and rostering has been the topic of...

Wir betrachten sog. Transferable-Put-Rights (TPRs), die im Rahmen eines Aktienrückkaufs per Tender-Offer den Aktionären gewährt werden können und als das spiegelbildliche Äquivalent zu den in Deutschland traditionell bei Kapitalerhöhungen ausgegebenen Bezugsrechten anzusehen sind....

This paper addresses the airport flight gate assignment problem with multiple objectives. The objectives are to maximize the total flight gate preferences, to minimize the number of towing activities and to minimize the absolute deviation of the new gate assignment from a so-called reference...

This paper deals with automated guided vehicles (AGVs) which transport containers between the quai and the stack on automated container terminals. The focus is on the assigment of transportation jobs to AGVs within a terminal control system operating in real time. First, we describe a rather...

This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...

The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-tree relaxation can be used. We...

Im Rahmen der Markteintrittsstrategie muss sich jedes Unternehmen nicht nur mit der Frage auseinandersetzen, wo und wie, sondern vor allem wann ein neuer Markt betreten wird. Insbesondere für die Pionierstrategie ist diese Frage auf vielfältige theoretische und empirische Weise untersucht...