#### Filter Results:

#### Publication Year

1991

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Dirk Steenken, Stefan Voß, Robert Stahlbock
- 2003

In the last four decades the container as an essential part of a unit-load-concept has achieved undoubted importance in international sea freight transportation. With ever increasing containerization the number of seaport container terminals and competition among them have become quite remarkable. Operations are nowadays unthinkable without effective and… (More)

VoD, S., Steiner's problem in graphs: heuristic methods, Discrete Applied Mathematics 40 (1992) 45-72. Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner's problem in graphs is included within this context.… (More)

- Raffaele Cerulli, Andreas Fink, Monica Gentili, Stefan Voß
- 2004

We study the Minimum Labelling Spanning Tree Problem: Given a graph G with a color (label) assigned to each edge (not necessarily properly) we look for a spanning tree of G with the minimum number of different colors. The problem has several applications in telecommuni-cation networks, electric networks, multimodal transportation networks, among others,… (More)

In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to ®nd routes starting from the given depots or centers such that each required arc is served, capacity (and usually additional) constraints are satis®ed and total travel cost is minimized. In this paper we consider a heuristic transformation of the M-CARP into a multiple… (More)