Order picking is the problem of collecting a set of products in a warehouse in a minimum
amount of time. It is currently a major bottleneck in supply-chain because of its cost in time …

The picker routing problem (PRP) is one of the most crucial problems in warehouse
management. It is also defined as the Steiner Traveling Salesman Problem (Steiner TSP) …

Permutation pattern-avoidance is a central concept of both enumerative and extremal
combinatorics. In this paper we study the effect of permutation pattern-avoidance on the …

In this paper we introduce self-approaching graph drawings. A straight-line drawing of a
graph is self-approaching if, for any origin vertex s and any destination vertex t, there is an st …

We consider the generalized minimum Manhattan network problem (GMMN). The input to
this problem is a set R of n pairs of terminals, which are points in R^ 2 R 2. The goal is to find …

We study the minimum Manhattan network problem, which is defined as follows. Given a set
of points called terminals in R^d, find a minimum-length network such that each pair of …

In the d-dimensional Generalized Minimum Manhattan Network (d-GMMN) problem one is
interested in finding a minimum cost rectilinear network N connecting a given set R of n pairs …

Given an points in two dimensional space, a Manhattan Network G is a network that
connects all n points with either horizontal or vertical edges, with the property that for any …

We study the generalized minimum Manhattan network (GMMN) problem: given a set PP of
pairs of points in the Euclidean plane R^ 2 R 2, we are required to find a minimum-length …

Given a set T of n points in ℝ2, a Manhattan network on T is a graph G=(V, E) with the
property that all the edges in E are vertical or horizontal line segments connecting points in …