scientific article; zbMATH DE number 3291744
From MaRDI portal
Publication:5574527
zbMath0183.22804MaRDI QIDQ5574527
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
Simpliciality of strongly convex problems ⋮ Acceleration of the HAP approach for the multifacility location problem ⋮ Sets of efficient points in a normed space ⋮ Location problems with costs being sums of powers of Euclidean distances ⋮ On duality in the vectorial control-approximation problem ⋮ The algebraic degree of geometric optimization problems ⋮ The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829 ⋮ On a problem of P. Erdös ⋮ Hamilton-Jacobi scaling limits of Pareto peeling in 2D ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ The linearized version of an algorithm for the mixed norms problem ⋮ Social choice for bliss-point problems ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Locational analysis ⋮ Hull properties in location problems ⋮ A fixed point algorithm for solving the Euclidean multifacility location problem in a tree ⋮ \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ Homogeneity analysis using absolute deviations ⋮ A quadratically convergent method for minimizing a sum of euclidean norms ⋮ A note on the Weber location problem ⋮ Explicit duality for convex homogeneous programs ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ Correspondence analysis with least absolute residuals ⋮ Normative location theory: Placement in continuous space ⋮ Algebraic optimization: The Fermat-Weber location problem ⋮ Weber's problem and weiszfeld's algorithm in general spaces ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Contour approximation of data: a duality theory ⋮ Some duality relationships for the generalized Neyman-Pearson problem ⋮ Efficiency in integral facility design problems ⋮ On the convergence of the generalized Weiszfeld algorithm ⋮ Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem ⋮ Duality relationships for a nonlinear version of the generalized Neyman- Pearson problem ⋮ Row rank = column rank ⋮ Duality for optimal control-approximation problems with gauges ⋮ Geometrical properties of the Fermat-Weber problem ⋮ Localization in single facility location ⋮ The dynamics and internal geometry of the three-city noxious location problem ⋮ Efficiency in Euclidean constrained location problems
This page was built for publication:
