scientific article; zbMATH DE number 1091317

From MaRDI portal
Publication:4367080

zbMath0883.90079MaRDI QIDQ4367080

Frank Plastria

Publication date: 25 November 1997


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (23)

A linear time algorithm for inverse obnoxious center location problems on networksInverse median problemsOptimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networksLocating landfills--optimization vs. realityA genetic algorithm for the \(p\)-median problem with pos/neg weightsReview of obnoxious facilities location problemsAn agent-based framework for modeling and solving location problemsA hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weightsOptimal algorithms for inverse vertex obnoxious center location problems on graphsCombinatorial algorithms for reverse selective undesirable center location problems on cycle graphsDiscrete facility location and routing of obnoxious activities.Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networksLocating a low-level waste disposal siteAn ant colony algorithm for the pos/neg weighted \(p\)-median problemLocation of a facility minimizing nuisance to or from a planar networkDiscrete location problems with push-pull objectivesLocating a semi-obnoxious facility in the special case of Manhattan distancesA fractional model for locating semi-desirable facilities on networksOptimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networksA polynomial method for the pos/neg weighted 3-median problem on a treeUndesirable facility location with minimal covering objectivesEfficiency for continuous facility location problems with attraction and repulsionMaximin location: Discretization not always works




This page was built for publication: