𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple heuristic for the p-centre problem

✍ Scribed by M.E Dyer; A.M Frieze

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
169 KB
Volume
3
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simple Lagrangian heuristic for the set
Simple Lagrangian heuristic for the set covering problem
✍ Salim Haddadi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 353 KB

In this paper a simple Lagrangian heuristic is proposed for the set covering problem. It is based on simple and classica1 ideas: Lagrangian duality, greedy heuristic for the set covering problem, subgradient optimization and redundant covers. The main interesting point of the paper lies in the fact

A dynamic programming heuristic for the
A dynamic programming heuristic for the P-median problem
✍ Michelle Hribar; Mark S. Daskin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 682 KB

A new heuristic algorithm is proposed for the P-median problem. The heuristic restricts the size of the state space of a dynamic programming algorithm. The approach may be viewed as an extension of the myopic or greedy adding algorithm for the P-median model. The approach allows planners to identify