Exact algorithms for the order picking problem
L Pansart, N Catusse, H Cambazard - Computers & Operations Research, 2018 - Elsevier
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 …
amount of time. It is currently a major bottleneck in supply-chain because of its cost in time …
Steiner TSP based on aisle as a unit for order picking
Y Su, M Li, X Zhu, C Li - Computers & Industrial Engineering, 2022 - Elsevier
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) …
management. It is also defined as the Steiner Traveling Salesman Problem (Steiner TSP) …
[PDF][PDF] Optimization with pattern-avoiding input
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 …
combinatorics. In this paper we study the effect of permutation pattern-avoidance on the …
Self-approaching graphs
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 …
graph is self-approaching if, for any origin vertex s and any destination vertex t, there is an st …
Approximating the generalized minimum Manhattan network problem
A Das, K Fleszar, S Kobourov, J Spoerhase… - Algorithmica, 2018 - Springer
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 …
this problem is a set R of n pairs of terminals, which are points in R^ 2 R 2. The goal is to find …
Approximating minimum Manhattan networks in higher dimensions
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 …
of points called terminals in R^d, find a minimum-length network such that each pair of …
[PDF][PDF] The generalized minimum Manhattan network problem (GMMN)–scale-diversity aware approximation and a primal-dual algorithm
S Funke, MP Seybold - Proceedings of Canadian Conference on …, 2014 - cccg.ca
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 …
interested in finding a minimum cost rectilinear network N connecting a given set R of n pairs …
A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
MMR Sanim, S Saira, FF Ahsan, R Bardhan… - arXiv preprint arXiv …, 2024 - arxiv.org
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 …
connects all n points with either horizontal or vertical edges, with the property that for any …
Dynamic programming approach to the generalized minimum Manhattan network problem
Y Masumura, T Oki, Y Yamaguchi - Algorithmica, 2021 - Springer
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 …
pairs of points in the Euclidean plane R^ 2 R 2, we are required to find a minimum-length …
Greedy construction of 2-approximate minimum Manhattan networks
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 …
property that all the edges in E are vertical or horizontal line segments connecting points in …