SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The obnoxious p facility network location problem with facility interaction
13 references·0 citing·43 second hop
The obnoxious p facility network location problem with facility interaction (1997)The obnoxious p facility network location…Location of semi-obnoxious facilities (1997)Location of semi-obnoxious fa…A branch-and-bound algorithm for the location of facilities causing atmospheric pollution (1992)A branch-and-bound algorithm …Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials (1988)Optimal Obnoxious Paths on a …Locating an undesirable facility with a minimax criterion (1986)Locating an undesirable facil…Medi-Centers of a Tree (1985)Medi-Centers of a TreeLocation of Multiple Obnoxious Facilities (1985)Location of Multiple Obnoxiou…LOCATING AN UNDESIRABLE FACILITY WITHIN A GEOGRAPHICAL REGION USING THE MAXIMIN CRITERION* (1985)LOCATING AN UNDESIRABLE FACIL…An Analysis of Network Location Problems with Distance Constraints (1984)An Analysis of Network Locati…A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks (1984)A Linear-Time Algorithm for M…A Maxmin Location Problem (1980)A Maxmin Location ProblemA Maximin Location Problem with Maximum Distance Constraints (1980)A Maximin Location Problem wi…Locating an Obnoxious Facility on a Network (1978)Locating an Obnoxious Facilit…Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph (1978)Finding Minimal Center-Median…OPTIMAL LOCATION UNDER TIME OR DISTANCE CONSTRAINTS (1972)A note on the location of an obnoxious facility on a network (2000)A comparison of multi-objective spatial dispersion models for managing critical assets in urban areas (2012)The Weber obnoxious facility location model: A Big Arc Small Arc approach (2018)Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Optimal Center Location in Simple Networks (1971)Location on Networks: Theory and Algorithms (1979)Reducibility of minimax to minisum 0–1 programming problems (1981)A geometrical solution for quadratic bicriteria location models (1999)MCDM Location Problems (2005)THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* (1976)New perspectives in competitive location theory (1981)Multicriteria location of thermal power plants (1990)Finite Dominating Sets for Network Location Problems (1991)Convex Location Problems on Tree Networks (1976)Single Facility Location on Networks (1987)Undesirable facility location problems on multicriteria networks (2005)Strategy-proof approximation mechanisms for an obnoxious facility game on networks (2011)Nonlinear and Dynamic Programming (1966)Geometrical Solutions for Some Minimax Location Problems (1972)Location Models with Routing Considerations for a Single Obnoxious Facility (1993)Optimal location of routes for vehicles transporting hazardous materials (1995)Review of obnoxious facilities location problems (2021)Central Facilities Location (1970)The Location of Emergency Service Facilities (1971)State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems (1983)Obnoxious Facility Location on Graphs (1991)Applying simulated annealing to location-planning models (1996)The equitable dispersion problem (2008)Minimax Multifacility Location with Euclidean Distances (1976)Facility Layout and Location: An Analytical Approach (1991)Undesirable facility location with minimal covering objectives (1999)Analytical models for locating undesirable facilities (1989)Multiobjective analysis of facility location decisions (1990)Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location (1991)A D.C. biobjective location model (2002)Efficient Location for a Semi-Obnoxious Facility (2003)Fifty Years of Location Theory - A Selective Review (2024)Easy and hard bottleneck location problems (1979)Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems (1987)Interactions between operational research and environmental management (1995)Finding minimum and equitable risk routes for hazmat shipments (2005)A decision support system for integrated hazardous materials routing and emergency response decisions (2008)
this work references cited by second hop

References

  • 1988Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials234 cited
  • 1978Locating an Obnoxious Facility on a Network229 cited
  • 1984An Analysis of Network Location Problems with Distance Constraints216 cited
  • 1978Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph104 cited
  • 1980A Maxmin Location Problem79 cited
  • 1980A Maximin Location Problem with Maximum Distance Constraints65 cited
  • 1984A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks47 cited
  • 1997Location of semi-obnoxious facilities44 cited
  • 1985Location of Multiple Obnoxious Facilities40 cited
  • 1985Medi-Centers of a Tree38 cited
  • 1985LOCATING AN UNDESIRABLE FACILITY WITHIN A GEOGRAPHICAL REGION USING THE MAXIMIN CRITERION*37 cited
  • 1986Locating an undesirable facility with a minimax criterion27 cited
  • 1992A branch-and-bound algorithm for the location of facilities causing atmospheric pollution24 cited

Cited by

No citing works inside the corpus for this window.

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