A new algorithm for the minimax location problem with the closest distance
From MaRDI portal
Publication:6092935
Recommendations
Cites work
- A fast algorithm for the rectilinear distance location problem
- A subgradient algorithm for certain minimax and minisum problems
- About regularity of collections of sets
- Algorithms with adaptive smoothing for finite minimax problems
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- An algorithm for the minimax Weber problem
- An Approach to Location Models Involving Sets as Existing Facilities
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Approximate minimum enclosing balls in high dimensions using core-sets
- Constrained minimum enclosing circle with center on a query line segment
- Convex Analysis
- Derivative-free optimization methods for finite minimax problems
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Duality results for nonlinear single minimax location problems via multi-composed optimization
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Efficient algorithms for the smallest enclosing ball problem
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 849181 (Why is no real title available?)
- scientific article; zbMATH DE number 908535 (Why is no real title available?)
- scientific article; zbMATH DE number 1423921 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Locating facilities by minimax relative to closest points of demand areas
- Location of facilities with rectangular distances among point and area destinations
- Minisum location with closest Euclidean distances
- Solving general continuous single facility location problems by cutting planes
- Techniques of variational analysis
- The method of projections for finding the common point of convex sets
- The Minimum Covering Sphere Problem
- The optimal solution set of the multi-source Weber problem
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- The Weber problem with regional demand
- Two Algorithms for the Minimum Enclosing Ball Problem
- Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
Cited in
(4)
This page was built for publication: A new algorithm for the minimax location problem with the closest distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092935)
