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

DOI10.1007/S10479-014-1587-5MaRDI QIDQ512990zbMATH OpenOpenAlexFDO

Authors 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

downgradingfacility locationFermat-Weber problemknapsack Voronoi diagramnon-convex optimizationnonlinear optimizationpolynomial algorithmupgrading

Mathematics Subject Classification ID

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

Recommendations

• Upgrading \(p\)-median problem on a path
• Up- and downgrading the 1-center in a network
• Facility location problems with uncertainty on the plane
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Inverse median location problems with variable coordinates

Cites work

• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
• Continuous location of an assembly station
• Finding an Euclidean anti-\(k\)-centrum location of a set of points
• GBSSS: The generalized big square small square method for planar single- facility location
• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 4074780 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 204196 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Location theory. A unified approach
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• On minquantile and maxcovering optimisation
• 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
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The inverse Fermat-Weber problem
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Up- and downgrading the 1-center in a network

Cited in

(10)

• Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
• Single facility siting involving allocation decisions
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Upgrading edges in the maximal covering location problem
• On the complexity of the upgrading version of the maximal covering location problem
• Some upgrading problems on networks related to eccentricity concept
• Edge downgrades in the maximal covering location problem
• Reviewing extensions and solution methods of the planar Weber single facility location problem
• Stability radius and an upgrading model of median location on trees
• The covering tour problem with path upgrades

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512990)