SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
3 references·1 citing·19 second hop
Lagrangean relaxation with clusters for point-feature cartographic label placement problems (2006)Lagrangean relaxation with clusters for p…Closest assignment constraints and location models: Properties and structure (1996)Closest assignment constraint…An Analysis of Network Location Problems with Distance Constraints (1984)An Analysis of Network Locati…An Algorithm for Automatic Name Placement Around Point Data (1982)An Algorithm for Automatic Na…A decomposition approach for the probabilistic maximal covering location-allocation problem (2008)A decomposition approach for …Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Central Facilities Location (1970)Spatial Interaction Models:Formulations and Applications (1988)Closest assignment constraints in discrete location problems (2011)The maximin HAZMAT routing problem (2014)Hierarchical earthquake shelter planning in urban areas: A case for Shanghai in China (2017)THE MAXIMAL COVERING LOCATION PROBLEM (1974)Network and Discrete Location: Models, Algorithms and Applications. (1997)Ambulance location and relocation models (2003)The continuous maximal covering location problem in large-scale natural disaster rescue scenes (2020)A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutions (2021)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)Expert Systems in Cartographic Design (1991)Towards an evaluation of quality for names placement methods (2002)A.-M. Guerry’s Moral Statistics of France: Challenges for Multivariable Spatial Analysis (2007)
this work references cited by second hop

References

  • 1984An Analysis of Network Location Problems with Distance Constraints216 cited
  • 1982An Algorithm for Automatic Name Placement Around Point Data116 cited
  • 1996Closest assignment constraints and location models: Properties and structure70 cited

Cited by

  • 2008A decomposition approach for the probabilistic maximal covering location-allocation problem33 cited

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