SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks
3 references·7 citing·26 second hop
A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks (1984)A Linear-Time Algorithm for Maxisum Facil…Locating an Obnoxious Facility on a Network (1978)Locating an Obnoxious Facilit…Convex Location Problems on Tree Networks (1976)Convex Location Problems on T…Optimal Center Location in Simple Networks (1971)Optimal Center Location in Si…Multiple obnoxious facilities location: A cooperative model (2020)Multiple obnoxious facilities…The Location of Undesirable Facilities (2011)The Location of Undesirable F…Strategy-proof approximation mechanisms for an obnoxious facility game on networks (2011)Strategy-proof approximation …The -maxian problem on a tree (2006)The -maxian problem on a treeUndesirable facility location problems on multicriteria networks (2005)Undesirable facility location…The obnoxious p facility network location problem with facility interaction (1997)The obnoxious p facility netw…Single Facility Location on Networks (1987)Single Facility Location on N…Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Nonlinear and Dynamic Programming (1966)Facility Location: A Survey of Applications and Methods. (1996)On locating new facilities in a competitive environment (1983)Optimal sizes of facilities on a linear market (1989)Analytical models for locating undesirable facilities (1989)Network and Discrete Location: Models, Algorithms and Applications. (1997)Minimax Location of a Facility in an Undirected Tree Graph (1973)A Cut Approach to the Rectilinear Distance Facility Location Problem (1978)Outcomes of voting and planning (1981)Minmax Regret Median Location on a Network Under Uncertainty (2000)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Mechanism Design for Facility Location Problems: A Survey (2021)An Analysis of Network Location Problems with Distance Constraints (1984)Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials (1988)Discrete location theory (1991)Facility location : applications and theory (2001)The law of retail gravitation (1931)Defining and Estimating a Trading Area (1964)Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem (2000)Easy and hard bottleneck location problems (1979)Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems (1987)Location Science Research: A Review (2003)Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects (2007)
this work references cited by second hop

References

  • 1971Optimal Center Location in Simple Networks386 cited
  • 1978Locating an Obnoxious Facility on a Network229 cited
  • 1976Convex Location Problems on Tree Networks95 cited

Cited by

  • 2011Strategy-proof approximation mechanisms for an obnoxious facility game on networks93 cited
  • 1987Single Facility Location on Networks31 cited
  • 2005Undesirable facility location problems on multicriteria networks30 cited
  • 2011The Location of Undesirable Facilities29 cited
  • 2020Multiple obnoxious facilities location: A cooperative model26 cited
  • 2006The -maxian problem on a tree25 cited
  • 1997The obnoxious p facility network location problem with facility interaction23 cited

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