A convex Hull algorithm for solving a location problem

DOI10.1051/RO/2014058zbMath1321.52001OpenAlexW1994563115MaRDI QIDQ5501876

Nguyen Kieu Linh, Le Dung Muu

Publication date: 14 August 2015

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6b953207fa49112c70da3a5253675d9405520ee0

zbMATH Keywords

location problemsubgradient methoddistance geometryconvex hullQuickhull algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (1)

An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)

Uses Software

• Qhull

Cites Work

• GBSSS: The generalized big square small square method for planar single- facility location
• A fast convex hull algorithm
• An iterative approach to quadratic optimization
• Introductory lectures on convex optimization. A basic course.
• Quicker than Quickhull
• Method of orienting curves for determining the convex hull of a finite set of points in the plane
• The Minisum and Minimax Location Problems Revisited
• On the Average Number of Maxima in a Set of Vectors and Applications
• A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
• Optimization of Convex Risk Functions
• Convex Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: A convex Hull algorithm for solving a location problem