scientific article; zbMATH DE number 849181

From MaRDI portal
Publication:4865765

DOI<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

Constrained location of competitive facilities in the planeCombinatorial algorithms for some 1-facility median problems in the planeA unified model for Weber problems with continuous and network distancesAn efficient solution method for Weber problems with barriers based on genetic algorithmsDominance rules for the optimal placement of a finite-size facility in an existing layoutThe Weber problem in congested regions with entry and exit pointsThe Weber obnoxious facility location model: a big arc small arc approachA note on center problems with forbidden polyhedraBicriteria and restricted 2-facility Weber problemsGeneralization of the restricted planar location problems: unified metaheuristic algorithmsLocation and layout planning. A surveyA new algorithm for the minimax location problem with the closest distanceConvex hull results on quadratic programs with non-intersecting constraintsA capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locationsAn algorithm for generalized constrained multi-source Weber problem with demand substationsQuasiconvex constrained multicriteria continuous location problems: structure of nondominated solution setsConditional facility location problems with continuous demand and a polygonal barrierPlanar weber location problems with line barriersOptimization of the norm of a vector-valued DC function and applicationsDiscrete location problems with push-pull objectivesError bounds for the approximative solution of restricted planar location problemsSupply facility and input/output point locations in the presence of barriersSuccessive computation of some efficient locations of the Weber problem with barriersUndesirable facility location with minimal covering objectivesComplexity results on planar multifacility location problems with forbidden regionsMulticriteria planar location problemsThe rectilinear distance Weber problem in the presence of a probabilistic line barrierGeometric methods to solve max-ordering location problemsSolving restricted line location problems via a dual interpretationSome personal views on the current state and the future of locational analysisRestricted center problems under polyhedral gaugesUnnamed ItemThe \(K\)-connection location problem in a plane



Cites Work