Article1989

THE MAXIMUM CAPTURE PROBLEM IN A WEIGHTED NETWORK*

46 citations0/0 files storedJournal of Regional 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 Optimization and Mathematical Programming

Abstract

ABSTRACT. In this paper, a conditional location problem on a weighted network is examined. Attraction functions are defined and the problem is formulated as a mixed integer program. A method which simultaneously locates an additional facility on the given network and optimizes its weight is then described. A numerical example is provided.

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

References

1964Defining and Estimating a Trading Area 1983On locating new facilities in a competitive environment 1929Methods for the study of retail relationships 1986THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK*1980Weighting Thiessen Polygons

Cited by

1998Some personal views on the current state and the future of locational analysis 2011Equilibria in Competitive Location Models 2014On agglomeration in competitive location models 2004Discretization and resolution of the (r|X p )-medianoid problem involving quality criteria 2005Single-period location models for subsidized housing: Project-based subsidies 2003All Stackelberg Location Equilibria in the Hotelling's Duopoly Model on a Tree with Parametric Prices 2009Discrete location planning

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.