Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem

DOI10.1287/MNSC.24.16.1763zbMath0491.90036OpenAlexW2002173558MaRDI QIDQ3953534

Samuel Eilon, Roberto Diéguez Galvão

Publication date: 1978

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.24.16.1763

zbMATH Keywords

computational experienceheuristic procedurep-median problemdouble vertex substitutionsimple vertex addition heuristicuncapacitated minisum network location

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (5)

A graph theoretical bound for the p-median problem ⋮ Lagrangean heuristics for location problems ⋮ A Lagrangean heuristic for the maximal covering location problem ⋮ Heuristic methods and applications: A categorized survey ⋮ A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem

This page was built for publication: Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem