Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams

DOI10.1007/s10479-014-1587-5zbMath1358.90070OpenAlexW1998699120MaRDI QIDQ512990

Frank Plastria

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1587-5

zbMATH Keywords

nonlinear optimizationpolynomial algorithmfacility locationnon-convex optimizationFermat-Weber problemdowngradingknapsack Voronoi diagramupgrading

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (3)

Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Single facility siting involving allocation decisions ⋮ Upgrading edges in the maximal covering location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous location of an assembly station
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Finding an Euclidean anti-\(k\)-centrum location of a set of points
• The inverse Fermat-Weber problem
• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
• On the point for which the sum of the distances to \(n\) given points is minimum
• Up- and downgrading the 1-center in a network
• GBSSS: The generalized big square small square method for planar single- facility location
• On minquantile and maxcovering optimisation
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Location Theory
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions

This page was built for publication: Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams