The collection depots location problem on networks

Oded Berman · Zvi Drezner · George O. Wesolowsky

25 citations0/0 files storedNaval Research Logistics (NRL)

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

Abstract In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000

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

References

1991Discrete location theory 1973Minimax Location of a Facility in an Undirected Tree Graph 1991Finite Dominating Sets for Network Location Problems 2001On the collection depots location problem 1985One‐facility location with rectilinear tour distances

Cited by

2004Minisum collection depots location problem with multiple facilities on a network 2007The multiple location of transfer points 2011Stochastic models for transfer point location problem

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.