scientific article; zbMATH DE number 849181
From MaRDI portal
Publication:4865765
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-X" /><967::AID-NAV3220420608>3.0.CO;2-X 10.1002/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-XzbMath0845.90082MaRDI QIDQ4865765
Stefan Nickel, Horst W. Hamacher
Publication date: 28 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Constrained location of competitive facilities in the plane ⋮ Combinatorial algorithms for some 1-facility median problems in the plane ⋮ A unified model for Weber problems with continuous and network distances ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Dominance rules for the optimal placement of a finite-size facility in an existing layout ⋮ The Weber problem in congested regions with entry and exit points ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ A note on center problems with forbidden polyhedra ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Location and layout planning. A survey ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Planar weber location problems with line barriers ⋮ Optimization of the norm of a vector-valued DC function and applications ⋮ Discrete location problems with push-pull objectives ⋮ Error bounds for the approximative solution of restricted planar location problems ⋮ Supply facility and input/output point locations in the presence of barriers ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Undesirable facility location with minimal covering objectives ⋮ Complexity results on planar multifacility location problems with forbidden regions ⋮ Multicriteria planar location problems ⋮ 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 ⋮ Some personal views on the current state and the future of locational analysis ⋮ Restricted center problems under polyhedral gauges ⋮ Unnamed Item ⋮ The \(K\)-connection location problem in a plane
Cites Work
This page was built for publication:
