Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
From MaRDI portal
Publication:832797
Recommendations
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- Location of Multiple Obnoxious Facilities
- scientific article; zbMATH DE number 961966
- Review of obnoxious facilities location problems
- Models and algorithms of semi-obnoxious facility location problems
Cites work
- scientific article; zbMATH DE number 1748997 (Why is no real title available?)
- scientific article; zbMATH DE number 6985640 (Why is no real title available?)
- scientific article; zbMATH DE number 961966 (Why is no real title available?)
- A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
- A multiobjective model for locating undesirable facilities
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- A new compact formulation for the discrete \(p\)-dispersion problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Exact and heuristic approaches for the locational planning of an integrated solid waste management system
- Introduction to algorithms.
- Locating a semi-obnoxious facility in the special case of Manhattan distances
- Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms
- Obnoxious Centers in Graphs
- On covering location problems on networks with edge demand
- Probabilistic single obnoxious facility location with fixed budget
- Reverse 1-maxian problem with keeping existing 1-median
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- The maximin-maxisum network location problem
- The minimum weighted covering location problem with distance constraints
- The obnoxious \(p\) facility network location problem with facility interaction
- Undesirable facility location with minimal covering objectives
This page was built for publication: Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832797)
