SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

New heuristic algorithms for solving the planar p-median problem · Study

ArticleShelves

ArticleNew heuristic algorithms for solving the planar p-median problem

Zvi Drezner2014

OA

Articlegreen2014

New heuristic algorithms for solving the planar p-median problem

Zvi Drezner · Jack Brimberg · Nenad Mladenović A · Saı̈d Salhi

63 citations·0/0 files stored·Computers & Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Metaheuristic Optimization Algorithms Research Vehicle Routing Optimization Methods

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 63 citations exist upstream.

References

1963Location-Allocation Problems 1964Heuristic Methods for Location-Allocation Problems 1997Variable neighborhood search for the p-median 2003An Efficient Genetic Algorithm for the p-Median Problem 1971Distribution management : mathematical modelling and practical analysis 2000Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem 1983A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems 1984The Planar Two-Center and Two-Median Problems

Cited by

2019Introduction to Location Science 2015Introduction to Location Science 2015Incorporating neighborhood reduction for the solution of the planar p-median problem 2020Using metaheuristics for the location of bicycle stations 2017Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2015New local searches for solving the multi-source Weber problemarticle · 11 shared references 2015Incorporating neighborhood reduction for the solution of the planar p-median problemarticle · 11 shared references 2012A new heuristic for solving the p-median problem in the planearticle · 8 shared references 2013A new local search for continuous location problemsarticle · 7 shared references 2011Heuristics for Location Modelschapter · 7 shared references 2011An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problemarticle · 6 shared references

Details

Year2014

Typearticle

Published2014-05-27

VenueComputers & Operations Research

ISSN-L0305-0548

Languageen

Citations63

Files0 public / 0

ShelfFacility Location and Emergency Management

Identifiers

doi10.1016/j.cor.2014.05.010

openalex_workW2054920135

Links

Imported from OpenAlex (CC0) — nothing here is generated.