scientific article; zbMATH DE number 1340521
From MaRDI portal
Publication:4265879
zbMath0940.90044MaRDI QIDQ4265879
Frank Plastria, Emilio Carrizosa
Publication date: 25 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Related Items (23)
A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ Locating landfills--optimization vs. reality ⋮ A genetic algorithm for the \(p\)-median problem with pos/neg weights ⋮ The multi-facility median problem with Pos/Neg weights on general graphs ⋮ Review of obnoxious facilities location problems ⋮ The multicriteria big cube small cube method ⋮ A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights ⋮ Discrete facility location and routing of obnoxious activities. ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ An ant colony algorithm for the pos/neg weighted \(p\)-median problem ⋮ An interactive solution approach for a bi-objective semi-desirable location problem ⋮ Extensions to the continuous ordered median problem ⋮ Discrete location problems with push-pull objectives ⋮ Locating a semi-obnoxious facility in the special case of Manhattan distances ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Euclidean push--pull partial covering problems ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams ⋮ A polynomial method for the pos/neg weighted 3-median problem on a tree ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
This page was built for publication:
