The Hamiltonean P-Median Problem
The paper is concerned with a new mixed routing location problem embedding the p - median and the travelling salesman problems. The Hamiltonean p - median problem (HPMP) is formulated and several heuristics are proposed. Computacional experience with a set of test problems is reported.
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/83772 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/83772 |