Publication:4788111
From MaRDI portal
zbMath1027.90055MaRDI QIDQ4788111
Publication date: 20 January 2003
90B85: Continuous location
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Construction Line Algorithms for the Connection Location-Allocation Problem, Location Problems with Cutoff, Solving Weber problem on plane with minimax criterion and forbidden gaps, The Weber problem in congested regions with entry and exit points, A planar single facility location and border crossing problem, A projected Weiszfeld algorithm for the box-constrained Weber location problem, On the use of the varignon frame for single facility Weber problems in the presence of convex barriers, Planar location problems with block distance and barriers, An efficient solution method for Weber problems with barriers based on genetic algorithms, Contour line construction for a new rectangular facility in an existing layout with rectangular departments, The multi-facility location-allocation problem with polyhedral barriers, Facility placement with sub-aisle design in an existing layout, The rectilinear distance Weber problem in the presence of a probabilistic line barrier, Algebraic properties of location problems with one circular barrier., A fast algorithm for the rectilinear distance location problem, Generalization of the restricted planar location problems: unified metaheuristic algorithms, Rectilinear distance to a facility in the presence of a square barrier, Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance, Prediction-correction alternating direction method for a class of constrained min-max problems, Planar multifacility location problems with tree structure and finite dominating sets, Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm, Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances, Complexity results on planar multifacility location problems with forbidden regions, A unified model for Weber problems with continuous and network distances, Successive computation of some efficient locations of the Weber problem with barriers, Location-based techniques for the synergy approximation in combinatorial transportation auctions
