Applications of the Location Set‐covering Problem

Charles ReVelle · Constantine Toregas · Louis Michael Falkson

134 citations0/0 files storedGeographical Analysis

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

The location set‐covering problem is extended to apply to three new situations. (1) The demands are assumed to occur continuously alone arcs of a network. (2) A mobile unit departs from one of the locations to be chosen and picks up the demand, providing service at a still more distant point. (3) New demands and sites occur over time.

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

References

1974THE MAXIMAL COVERING LOCATION PROBLEM 1971The Location of Emergency Service Facilities 1973Binary Logic Solutions to a Class of Location Problem*

Cited by

1979Location Modeling Utilizing Maximum Service Distance Criteria 1978Optimizing Access to Public Services: A Review of Problems, Models and Methods of Locating Central Facilities 1984The p -Median Structure as a Unified Linear Model for Location—Allocation Analysis 2008Locating Backup Facilities to Enhance Supply Chain Disaster Resilience 2001The fixed charge facility location problem with coverage restrictions 2005Designing emergency response networks for hazardous materials transportation 2009Cooperative cover location problems: The planar case 2008The variable radius covering 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.