Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
type: Item
instance of: scholarly article
title: Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
zbMATH Open document ID: 1358.90070
author: Frank Plastria
published in: Annals of Operations Research
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6691359
zbMATH Keywords: Fermat-Weber problem
zbMATH Keywords: facility location
zbMATH Keywords: upgrading
zbMATH Keywords: downgrading
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: non-convex optimization
zbMATH Keywords: knapsack Voronoi diagram
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: s10479-014-1587-5
OpenAlex ID: W1998699120
cites work: Q4695312
cites work: The inverse Fermat-Weber problem
cites work: On minquantile and maxcovering optimisation
cites work: Q3147656
cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
cites work: Up- and downgrading the 1-center in a network
cites work: A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
cites work: Q2753173
cites work: Q3806960
cites work: Q4821303
cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane
cites work: Finding an Euclidean anti-\(k\)-centrum location of a set of points
cites work: Q3993418
cites work: Location Theory
cites work: Q4484914
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: The Weiszfeld Algorithm: Proof, Amendments, and Extensions
cites work: On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
cites work: Continuous location of an assembly station
cites work: Q4235027
cites work: The theoretical and empirical rate of convergence for geometric branch-and-bound methods
cites work: On the point for which the sum of the distances to \(n\) given points is minimum
cites work: Q4229604
cites work: A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
DOI: 10.1007/S10479-014-1587-5
description: scientific article; zbMATH DE number 6691359