Technical Note—Conditional Location Problems on Networks

Oded Berman · David Simchi‐Levi

49 citations0/0 files storedTransportation Science

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 Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

Abstract

In this paper, we describe an algorithm to solve conditional location problems (such as the conditional p-median problem or the conditional p-center problem) on networks, where demand points are served by the closest facility whether existing or new. This algorithm requires the one-time solution of a (p + 1)-unconditional corresponding location problem using an appropriate shortest distance matrix.

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 — 49 citations exist upstream.

References

1979Location on Networks: Theory and Algorithms 1980Conditional centers and medians of a graph

Cited by

1995On the conditional p-median problem 2007The p-median problem under uncertainty 2002Demand Point Aggregation for Location Models 2015Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems 2018The Weber obnoxious facility location model: A Big Arc Small Arc approach 2008A new formulation for the conditional -median and -center problems 2014An adaptive multiphase approach for large unconditional and conditional p-median problems 2020Multiple obnoxious facilities location: A cooperative model

Explore the map →

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

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