Using Block Norms for Location Modeling
From MaRDI portal
Publication:3705189
DOI10.1287/opre.33.5.1074zbMath0582.90026OpenAlexW2133821366MaRDI QIDQ3705189
Richard E. Wendell, James E. Ward
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.5.1074
Numerical mathematical programming methods (65K05) Linear programming (90C05) Inventory, storage, reservoirs (90B05)
Related Items
A generalized Weber problem with different gauges for different regions, Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty, Directional bias of the \(l_ p\)-norm, Solving general continuous single facility location problems by cutting planes, Un algorithme pour résoudre une famille de problèmes de localisation multisources, Unnamed Item, Localization in multifacility location theory, A unified model for Weber problems with continuous and network distances, Locating hyperplanes to fitting set of points: a general framework, A planar single facility location and border crossing problem, Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems, The minimax center estimation problem for automated roundness inspection, Continuous maximal covering location problems with interconnected facilities, A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities, Ordered \(p\)-median problems with neighbourhoods, Learning with optimal interpolation norms, Finite and infinitesimal rigidity with polyhedral norms, Hamilton-Jacobi scaling limits of Pareto peeling in 2D, Distributionally robust Weber problem with uncertain demand, Generating valid linear inequalities for nonlinear programs via sums of squares, A primal-dual algorithm for the fermat-weber problem involving mixed gauges, The general optimal market area model, Determination of efficient solutions for point-objective locational decision problems, A variational inequality approach for constrained multifacility Weber problem under gauge, Geometric fit of a point set by generalized circles, Generalized light robustness and the trade-off between robustness and nominal quality, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, Continuous location under the effect of `refraction', The geometry of optimal partitions in location problems, Numerical optimization method for packing regular convex polygons, A biobjective approach to recoverable robustness based on location planning, A destination optimality in asymmetric distance Fermat-Weber problems, On bisectors for different distance functions, Was Euclid an unnecessarily sophisticated psychologist?, A new local search for continuous location problems, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Minimax centre estimation for inspection of spherical parts, Planar multifacility location problems with tree structure and finite dominating sets, Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem, Minsum hyperspheres in normed spaces, Facility location problems with uncertainty on the plane, Error bounds for the approximative solution of restricted planar location problems, Covering problems with polyellipsoids: a location analysis perspective, Practical aspects of route planning for magazine and newspaper wholesalers, Parametric distance functions vs. nonparametric neural networks for estimating road travel distances, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, Asymmetric distances, semidirected networks and majority in Fermat-Weber problems, Approximation of solutions for location problems, Weber problems with alternative transportation systems, Locating a general minisum `circle' on the plane, A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach, ADMM-type methods for generalized multi-facility Weber problem, A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, Some personal views on the current state and the future of locational analysis, Restricted center problems under polyhedral gauges, General models in min-max continuous location: Theory and solution techniques, Multicriteria planar ordered median problems, A branch-and-price approach for the continuous multifacility monotone ordered median problem, A deep cut ellipsoid algorithm for convex programming: Theory and applications, A single facility stochastic location problem under A-distance, Planar location problems with block distance and barriers, The \(K\)-connection location problem in a plane
