Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Solving Rectilinear Planar Location Problems with Barriers by a Polynomial Partitioning

4 references·2 citing·21 second hop

FromToDepth

this work references cited by second hop

References

1983Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel137 cited
1989Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions92 cited
2002An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers22 cited
1986Solving Nonlinear Single-Facility Network Location Problems19 cited

Cited by

2012Multi-facility location problems in the presence of a probabilistic line barrier: a mixed integer quadratic programming model: .17 cited
2013The center location-dependent relocation problem with a probabilistic line barrier14 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work