Pages that link to "Item:Q3359994"
From MaRDI portal
The following pages link to Comparison Of Four Models For dispersing Facilities (Q3359994):
Displaying 17 items.
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Facility dispersion and remote subgraphs (Q5054806) (← links)
- Location Science in Canada (Q6102878) (← links)
- Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)
