Journal ArticleDOI
Hamiltonian location problems
Reads0
Chats0
TLDR
In this paper, exact algorithms for a series of simultaneous location and routing problems are developed, which are formulated as integer programs which are solved by a constraint relaxation procedure, and numerical results are reported.About:
This article is published in European Journal of Operational Research.The article was published on 1983-01-01. It has received 96 citations till now. The article focuses on the topics: Covering problems & Hamiltonian (control theory).read more
Citations
More filters
Journal ArticleDOI
Facility location models for distribution system design
TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.
Journal ArticleDOI
Location-routing: Issues, models and methods
Gábor Nagy,Said Salhi +1 more
TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
Proceedings Article
A general approximation technique for constrained forest problems
TL;DR: A 2-approximation algorithm for the Steiner tree problem was given in this paper with running time of O(n 2 log n) for the shortest path problem, where n is the number of vertices in a graph.
Journal ArticleDOI
An overview of representative problems in location research
TL;DR: A survey of over 50 representative problems in location research can be found in this paper, where the authors focus on problems for which operations research-type models have been developed, and most of the problems have been formulated as optimization problems.
Journal ArticleDOI
Combined Location-Routing Problems: A Synthesis and Future Research Directions
TL;DR: This paper synthesizes the past evolution of location-routing literature and then explores promising research opportunities in incorporation of more realistic aspects, algorithmic design, and model complexity.
References
More filters
Journal ArticleDOI
Matching, euler tours and the chinese postman
Jack Edmonds,Ellis L. Johnson +1 more
TL;DR: The solution of the Chinese postman problem using matching theory is given and the convex hull of integer solutions is described as a linear programming polyhedron, used to show that a good algorithm gives an optimum solution.
Journal ArticleDOI
Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points
Anthony Wren,Alan Holliday +1 more
TL;DR: A new algorithm is presented that allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots, and a flexible priority rule will select those to be served.
Journal ArticleDOI
A comparative study of heuristics for a two-level routing-location problem
TL;DR: This paper gives a comparison of three different procedures for designing a suitable heuristic for solving the problem of a combined location/routing problem in the process of distributing newspapers.