Journal ArticleDOI
The traveling salesman problem on a graph and some related integer polyhedra
TLDR
Some facet inducing inequalities of the convex hull of the solutions to the Graphical Traveling Salesman Problem are given and the so-called comb inequalities of Grötschel and Padberg are generalized.Citations
More filters
Journal ArticleDOI
Design and control of warehouse order picking: A literature review
TL;DR: In this paper, a literature overview on typical decision problems in design and control of manual order-picking processes is given, focusing on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning.
Book
The Design of Approximation Algorithms
TL;DR: In this paper, the authors present a survey of the central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
Posted Content
Learning Combinatorial Optimization Algorithms over Graphs
TL;DR: In this paper, a combination of reinforcement learning and graph embedding is proposed to learn heuristics for combinatorial optimization problems over graphs, such as Minimum Vertex Cover, Maximum Cut and Traveling Salesman problems.
Journal ArticleDOI
Arc Routing Problems, Part II: The Rural Postman Problem
TL;DR: The Rural Postman Problem (RPP) is reviewed and applications are organized as follows: Applications, the Undirected R PP, the Directed RPP, the Stacker Crane problem, the Capacitated Arc Routing Problem.
References
More filters
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
Graph theory with applications (revised edition), by J. A. Bondy and U.S.R. Murty. Pp x, 264. £5·95 paperback. 1977. SBN 0 333 22694 1 (Macmillan)
Journal ArticleDOI
Matroids and the greedy algorithm
TL;DR: Linear-algebra rank is the solution to an especially tractable optimization problem which are linear programs relative to certain derived polyhedra.
Journal ArticleDOI
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
TL;DR: This paper addresses the problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles by presenting an algorithm for picking an order in minimum time.
Journal ArticleDOI
Linear-time computability of combinatorial problems on series-parallel graphs
TL;DR: It is shown in a umfied manner that there exist hnearume algorithms for many combinatorial problems ff an input graph is restricted to the class of series-parallel graphs.
Related Papers (5)
Solution of a Large-Scale Traveling-Salesman Problem
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
Manfred Padberg,Giovanni Rinaldi +1 more