Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
From MaRDI portal
Publication:832797
DOI10.1007/s12597-020-00487-0OpenAlexW3096508893MaRDI QIDQ832797
Mehdi Iranpoor, Kayhan Alamatsaz, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 25 March 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-020-00487-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covering location problems on networks with edge demand
- Probabilistic single obnoxious facility location with fixed budget
- A multiobjective model for locating undesirable facilities
- 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
- The obnoxious \(p\) facility network location problem with facility interaction
- Reverse 1-maxian problem with keeping existing 1-median
- A new compact formulation for the discrete \(p\)-dispersion problem
- Undesirable facility location with minimal covering objectives
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation
- 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
- The minimum weighted covering location problem with distance constraints
- Obnoxious Centers in Graphs
- A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
- The maximin-maxisum network location problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
This page was built for publication: Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
