Minisum location problem with farthest Euclidean distances

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Math. Methods Oper. Res.

• Publication date

  2006-07-21

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00186-006-0084-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Approach to Location Models Involving Sets as Existing Facilities

  2003influential reference
• Minisum Location with Closest Euclidean Distances

  2002cited by this paper
• Locating facilities by minimax relative to closest points of demand areas

  2002cited by this paper
• Note: Facility location with closest rectangular distances

  2000cited by this paper
• The Weber problem with regional demand

  1998cited by this paper
• Engineering and Economic Applications of Complementarity Problems

  1997cited by this paper
• Facility location: a survey of applications and methods

  1996cited by this paper
• Facility Location: A Survey of Applications and Methods

  1996cited by this paper
• Replacing Discrete Demand with Continuous Demand

  1995cited by this paper
• The generalized Weber problem with expected distances

  1995cited by this paper
• Continuous Location Problems

  1995cited by this paper
• LOCATING A NOXIOUS FACILITY WITH RESPECT TO SEVERAL POLYGONAL REGIONS USING ASYMMETRIC DISTANCES

  1993cited by this paper
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming

  1992cited by this paper
• Interactive computer graphical approaches to some maximin and minimax location problems

  1988cited by this paper
• Location of regional facilities

  1986cited by this paper
• An Algorithm for a Constrained Weber Problem

  1982influential reference
• Solutions of Constrained Location Problems

  1975cited by this paper
• A COMPUTATIONAL PROCEDURE FOR OPTIMALLY LOCATING A FACILITY WITH RESPECT TO SEVERAL RECTANGULAR REGIONS

  1972cited by this paper
• Location of facilities with rectangular distances among point and area destinations

  1971cited by this paper

• Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances

  2020cites this paper
• A modified particle swarm optimization algorithm for location problem

  2019cites this paper
• Robust semi-supervised clustering with polyhedral and circular uncertainty

  2017cites this paper
• A minisum location problem with regional demand considering farthest Euclidean distances

  2016influential citation
• Heuristics for a continuous multi-facility location problem with demand regions

  2015influential citation
• Planning a Capacitated Road Network with Flexible Travel Times: A Genetic Algorithm

  2015cites this paper
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand

  2012cites this paper
• Accelerating the convergence in the single-source and multi-source Weber problems

  2012cites this paper
• Distance Functions in Location Problems

  2009cites this paper