scientific article; zbMATH DE number 4123493
From MaRDI portal
Publication:4203976
zbMath0685.90036MaRDI QIDQ4203976
George O. Wesolowsky, Love, Robert F., James G. Morris
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
quadratic assignmentlocation-allocationplanetwo-dimensional spherefacilities location\(\ell _ p\)-normsite generation
Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty, Application of facility location modeling constructs to vendor selection problems, New simple and efficient heuristics for the uncapacitated single allocation hub location problem, Combinatorial algorithms for some 1-facility median problems in the plane, New approximation algorithms for the unsplittable capacitated facility location problem, On Newton's method for the Fermat-Weber location problem, Location and sizing of facilities on a line, The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance, Detailed layout planning for irregularly-shaped machines with transportation path design, Accelerating convergence in minisum location problem with \(\ell p\) norms, GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem, Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling, Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization, Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems, A new heuristic for solving the \(p\)-median problem in the plane, The \(p\)-median problem: a survey of metaheuristic approaches, The transfer point location problem, Placing a finite size facility with a center objective on a rectangular plane with barriers, Duality for location problems with unbounded unit balls, Competitive spatial models, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, On a facility location problem with applications to tele-diagnostic, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, A BSSS algorithm for the location problem with minimum square error, On solving the planar \(k\)-centrum problem with Euclidean distances, Cooperative games in facility location situations with regional fixed costs, Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods, Accelerating the convergence in the single-source and multi-source Weber problems, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, On the use of the varignon frame for single facility Weber problems in the presence of convex barriers, Sequential competitive location on networks, Gate points in continuous location between regions with different \(\ell _{p}\) norms, Locating an axis-parallel rectangle on a Manhattan plane, Geometric fit of a point set by generalized circles, Covering point sets with two disjoint disks or squares, Minimal length tree networks on the unit sphere, On a general network location--production--allocation problem, The Newton bracketing method for the minimization of convex functions subject to affine constraints, Smoothing Newton method for minimizing the sum of \(p\) -norms, The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution, GBSSS: The generalized big square small square method for planar single- facility location, A nonlinear optimization approach for solving facility layout problems, Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem, Local convergence in a generalized Fermat-Weber problem, Probabilistic \(l_ p\) distances in location models, Forecast horizons and dynamic facility location planning, A note on the Weber location problem, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance, Covering a line segment with variable radius discs, An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree, Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees, A globally convergent algorithm for the Euclidean multiplicity location problem, An entropy regularization technique for minimizing a sum of Tchebycheff norms, On the structure of the solution set for the single facility location problem with average distances, A generalized Weiszfeld method for the multi-facility location problem, Facility location models for distribution system design, Planar expropriation problem with non-rigid rectangular facilities, Minsum hyperspheres in normed spaces, Multiple criteria facility location problems: a survey, Solving scheduling and location problems in the plane simultaneously, Probabilistic d-clustering, Allocation search methods for a generalized class of location-allocation problems, Convex ordered median problem with \(\ell _p\)-norms, An efficient algorithm for facility location in the presence of forbidden regions, Parametric distance functions vs. nonparametric neural networks for estimating road travel distances, Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Accelerating convergence in the Fermat-Weber location problem, The projection median of a set of points, Efficiency for continuous facility location problems with attraction and repulsion, Inequality measures and equitable locations, Aggregation error for location models: Survey and analysis, On the convergence of the generalized Weiszfeld algorithm, Single facility location and relocation problem with time dependent weights and discrete planning horizon, Location with acceleration-deceleration distance, On the lexicographic minimax approach to location problems, Multicriteria planar location problems, Weber problems with alternative transportation systems, Locational optimization problems solved through Voronoi diagrams, Median hyperplanes in normed spaces -- a survey, Solving the plant location problem on a line by linear programming, A methodology for modelling travel distances by bias estimation, The rectilinear distance Weber problem in the presence of a probabilistic line barrier, Geometric methods to solve max-ordering location problems, Solving restricted line location problems via a dual interpretation, Semi-obnoxious location models: A global optimization approach, Some personal views on the current state and the future of locational analysis, Restricted center problems under polyhedral gauges, The Weber problem with regional demand, Locating and staffing service centers under service level constraints, Duality for optimal control-approximation problems with gauges, A polynomial time algorithm for a hemispherical minimax location problem, Heuristics for the p-hub location problem, A single facility stochastic location problem under A-distance, A globally convergent algorithm for facility location on a sphere, Maximizing trip coverage in the location of a single rapid transit alignment, A continuous location-allocation problem with zone-dependent fixed cost, Backup multifacility location problem with \(l_p\) norm, A genetic algorithm approach for regrouping service sites, Asymmetric distance location model, The uncapacitated r‐allocation p‐hub center problem, Controller placement problem in software‐defined networking: A survey, The extensive 1-median problem with radius on networks, The Weber Location Problem: The Threshold Objective, A trajectory based heuristic for the planar \(p\)-median problem, Obnoxious facility location in multiple dimensional space, Graphs with \(G^p\)-connected medians, The obnoxious competitive facility location model, The repeated p-dispersion problem, Solving a minisum single facility location problem in three regions with different norms, A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification, Extensions to the planar \(p\)-median problem, On the directional bias of the \(\ell_{bp}\)-norm, On the collection depots location problem, Unnamed Item, A heuristic for the location of a rapid transit line, Locating facilities by minimax relative to closest points of demand areas, On the circle closest to a set of points, Capacitated location-allocation problems on a line, Unnamed Item, Medians in median graphs and their cube complexes in linear time, The gradual covering problem, A fast algorithm for the rectilinear distance location problem, A mixed integer formulation for maximal covering by inclined parallelograms, Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces, Directional bias of the \(l_ p\)-norm, Optimal bin location and sequencing in printed circuit board assembly, Production/distribution system design with inventory considerations, The planar multifacility collection depots location problem, The Newton Bracketing Method for Convex Minimization: Convergence Analysis, The time constrained maximal covering salesman problem, Ordered median problem with demand distribution weights, On an open problem in spherical facility location, Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993, On the conditional \(p\)-median problem, Extensions to the Weber problem, A two-level off-grid electric distribution problem on the continuous space, A new approximation algorithm for the \(k\)-facility location problem, Locating a semi-obnoxious facility with expropriation, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, A d.c. optimization method for single facility location problems, An analytical solution to the minimum \(L_ p\)-norm of a hyperplane, An approximation method for bivariate and multvariate normal equiprobability contours, Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm, Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems, A triobjective model for locating a public semiobnoxious facility in the plane, A polynomial time dual algorithm for the Euclidean multifacility location problem, A maximum \(L_p\) distance problem, Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain, Single facility siting involving allocation decisions, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, A Planar Location-Allocation Problem with Waiting Time Costs, Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’, Multinational plant location as a game of timing, A voltage drop limited decentralized electric power distribution network, An approximation algorithm for the dynamic facility location problem with outliers, The discrete and mixed minimax 2-center problems, Characterizing cautious choice, On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\), Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm, A new algorithm for solving planar multiobjective location problems involving the Manhattan norm, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, Formulation of confidence intervals for estimated actual distances, Continuous location of dimensional structures., An approximation algorithm for soft capacitated \(k\)-facility location problem, On the convergence of a modified algorithm for the spherical facility location problem, Algebraic properties of location problems with one circular barrier., A variational inequality approach for constrained multifacility Weber problem under gauge, PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, An intermodal hub location problem for container distribution in Indonesia, Algorithms for the decomposition of a polygon into convex polygons, An algorithm for generalized constrained multi-source Weber problem with demand substations, OR models in urban service facility location: a critical review of applications and future developments, Optimization of competitive facility location for chain stores, An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach, Inverse quickest center location problem on a tree, Using the power of ideal solutions: simple proofs of some old and new results in location theory, The obnoxious facilities planar \(p\)-median problem, Classical and inverse median location problems under uncertain environment, A fuzzy algorithm for continuous capacitated location allocation model with risk consideration, Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, A new local search for continuous location problems, A BSSS algorithm for the single facility location problem in two regions with different norms, Simultaneous acceptance control charts for products with multiple correlated characteristics, A heuristic method for large-scale multi-facility location problems, New interval methods for constrained global optimization, Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane, Location analysis: a synthesis and survey, ε–Optimality to approximation in partially ordered spaces, Facility location problems with uncertainty on the plane, A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems, Quality locations for the constrained minimax location model, New convergence results for inertial Krasnoselskii-Mann iterations in Hilbert spaces with applications, Spherical minimax location problem using the Euclidean norm: Formulation and optimization, On the feasible set for the squared Euclidean Weber problem and applications, Improved starting solutions for the planar p-median problem, Unnamed Item, On the Quadratic Programming Approach for Hub Location Problems, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, Using injection points in reformulation local search for solving continuous location problems, A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach, Use of location-allocation models in health service development planning in developing nations, Generating good starting solutions for the p-median problem in the plane, A multiplicatively-weighted Voronoi diagram approach to logistics districting, Inequality measures and equitable approaches to location problems, An efficient algorithm for the Euclidean \(r\)-centrum location problem, Solving the multiple competitive facilities location problem, Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees, Optimal parking of idle elevators under myopic and state-dependent policies, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Locating a median line with partial coverage distance, A note on convergence in the single facility minisum location problem, A generalization of the rectangular bounding method for continuous location models, Application of decision analysis techniques to the Weber facility location problem, The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation, Linear models for the approximate solution of the problem of packing equal circles into a given domain
