A convex hull algorithm for solving a location problem
From MaRDI portal
Publication:5501876
Recommendations
Cites work
- A fast convex hull algorithm
- A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
- An iterative approach to quadratic optimization
- Convex Analysis
- GBSSS: The generalized big square small square method for planar single- facility location
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 970362 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- On the Average Number of Maxima in a Set of Vectors and Applications
- Optimization of Convex Risk Functions
- Quicker than Quickhull
- The Minisum and Minimax Location Problems Revisited
Cited in
(5)- Solving convex location problems with gauges in polynomial time
- A D.C. algorithm via convex analysis approach for solving a location problem involving sets
- Determining fire station location using convex hull
- scientific article; zbMATH DE number 245802 (Why is no real title available?)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
This page was built for publication: A convex hull algorithm for solving a location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501876)