The Hamiltonian p-median problem

The Hamiltonian p-median problem

0.00 Avg rating0 Votes
Article ID: iaor1992975
Country: Netherlands
Volume: 47
Issue: 1
Start Page Number: 86
End Page Number: 95
Publication Date: Jul 1990
Journal: European Journal of Operational Research
Authors:
Keywords: heuristics, programming: integer
Abstract:

This paper is concerned with a new mixed routing location problem embedding the p-median and the travelling salesman problems. The Hamiltonian p-median problem is formulated and several heuristics are proposed. Computational experience with a set of test problems is reported.

Reviews

Required fields are marked *. Your email address will not be published.