A matheuristic for locating obnoxious facilities
From MaRDI portal
Publication:6568397
DOI10.1016/J.COR.2024.106602MaRDI QIDQ6568397FDOQ6568397
Authors: Tamara Bigler 
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Local branching
- Location analysis: a synthesis and survey
- A branch-and-cut method for the obnoxious \(p\)-median problem
- On the unified dispersion problem: efficient formulations and exact algorithms
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- Obnoxious Facility Location on Graphs
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Obnoxious facility location in multiple dimensional space
- Progress in mathematical programming solvers from 2001 to 2020
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- Review of obnoxious facilities location problems
- Alternative formulations for the obnoxious \(p\)-median problem
- The obnoxious facilities planar \(p\)-median problem
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
This page was built for publication: A matheuristic for locating obnoxious facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568397)
