The Hamiltonian p-median problem

DOI10.1016/0377-2217(90)90092-PzbMath0706.90039OpenAlexW2011702214MaRDI QIDQ918861

Elsie Sterbin Gottlieb

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90092-p

zbMATH Keywords

heuristictravelling salesmanroutingset partitioning2-matching relaxationHamiltonian p-median

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (18)

Distribution network design on the battlefield ⋮ A survey of variants and extensions of the location-routing problem ⋮ Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem ⋮ Location-routing: issues, models and methods ⋮ A simple and effective evolutionary algorithm for the capacitated location-routing problem ⋮ Using clustering analysis in a capacitated location-routing problem ⋮ An endosymbiotic evolutionary algorithm for the hub location-routing problem ⋮ A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem ⋮ A survey of the standard location-routing problem ⋮ Node based compact formulations for the Hamiltonian p‐median problem ⋮ Decision support for the technician routing and scheduling problem ⋮ A hybrid genetic algorithm for the Hamiltonian p‐median problem ⋮ The Hamiltonian p-median problem ⋮ Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm ⋮ Facility location models for distribution system design ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ A new variant of a vehicle routing problem: Lower and upper bounds

Cites Work

• The Hamiltonian p-median problem
• A comparative study of heuristics for a two-level routing-location problem
• A large scale location-allocation problem in the natural rubber industry
• An exact algorithm for minimizing routing and operating costs in depot location
• Hamiltonian location problems
• The period routing problem
• One-facility location with rectilinear tour distances
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Algorithm 456: routing problem

This page was built for publication: The Hamiltonian p-median problem