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