Skip to search formSkip to main contentSkip to account menu

1-center problem

Known as: Minimax facility location, 1-center, Minmax facility location 
The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Bounding sphereClosest stringFacility location problemGeometric median

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function
In this paper we present algorithms for computing 1-center of a set of points for convex polyhedral distance function in… 
Review
2016
Review
2016
A Group Decision Making Procedure in the Context of Non-Uniform Qualitative Scales
Since the 1980s, studies of aggregation functions most often focus on the construction and formal analysis of diverse ways to… 
2015
2015
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
2014
2014
Riemannian Lp Averaging on Lie Group of Nonzero Quaternions
This paper discusses quaternion Lp geometric weighting averaging working on the multiplicative Lie group of nonzero quaternions… 
2013
2013
A geometric characterisation of the quadratic min-power centre
2010
2010
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
We study the problem of maintaining group communication between $m$ mobile agents, tracked and helped by $n$ static networked… 
2009
2009
Network location of a reliable center using the most reliable route policy
2007
2007
Two unconstrained optimization approaches for the Euclidean kappa-centrum location problem
2007
2007
Prunning can solve from facility location to visibility
We present several results concerning minimax facility location geometric problems with convex polygons de ned by intersection of… 
2003
2003
Facility Location on a Polyhedral Surface
Abstract Given an orientable genus-0 polyhedral surface defined by n triangles, and a set of m point sites} on it, we would like… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)