Comparison Of Four Models For dispersing Facilities
From MaRDI portal
Recommendations
Cited in
(24)- Integer-friendly formulations for the \(r\)-separation problem
- A comparison of \(p\)-dispersion heuristics
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- The discrete p-maxian location problem
- The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Alternative formulations for the obnoxious \(p\)-median problem
- t-linearization for the maximum diversity problem
- A hybrid metaheuristic method for the maximum diversity problem
- On the unified dispersion problem: efficient formulations and exact algorithms
- Review of obnoxious facilities location problems
- The disruptive anti-covering location problem
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
- Facility dispersion and remote subgraphs
- scientific article; zbMATH DE number 6285795 (Why is no real title available?)
- Location Science in Canada
- Formulations and valid inequalities for the capacitated dispersion problem
- Different formulations of the gray pattern problem and their optimal solutions
- Good solutions to discrete noxious location problems via metaheuristics
- Simultaneous convexification for the planar obnoxious facility location problem
- Construction and improvement algorithms for dispersion problems
- A branch-and-cut method for the obnoxious \(p\)-median problem
This page was built for publication: Comparison Of Four Models For dispersing Facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359994)
