A new algorithm for the minimax location problem with the closest distance

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Algorithms with adaptive smoothing for finite minimax problems
Constrained minimum enclosing circle with center on a query line segment
Discrete gradient method: Derivative-free method for nonsmooth optimization
The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
Solving general continuous single facility location problems by cutting planes
An algorithm for the minimax Weber problem
The Weber problem with regional demand
A fast algorithm for the rectilinear distance location problem
Duality results for nonlinear single minimax location problems via multi-composed optimization
An algorithm for generalized constrained multi-source Weber problem with demand substations
Efficient algorithms for the smallest enclosing ball problem
Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
Minisum location with closest Euclidean distances
An efficient algorithm for the smallest enclosing ball problem in high dimensions
The optimal solution set of the multi-source Weber problem
Techniques of variational analysis
About regularity of collections of sets
Two Algorithms for the Minimum Enclosing Ball Problem
An Efficient Geometric Solution to the Minimum Spanning Circle Problem
Efficient Algorithms for the (Weighted) Minimum Circle Problem
A subgradient algorithm for certain minimax and minisum problems
THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
Derivative-free optimization methods for finite minimax problems
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
An Incremental Method for Solving Convex Finite Min-Max Problems
Approximate minimum enclosing balls in high dimensions using core-sets
Convex Analysis
The method of projections for finding the common point of convex sets
Location of facilities with rectangular distances among point and area destinations
The Minimum Covering Sphere Problem
An Approach to Location Models Involving Sets as Existing Facilities
Locating facilities by minimax relative to closest points of demand areas

This page was built for publication: A new algorithm for the minimax location problem with the closest distance