Formulations and valid inequalities for the capacitated dispersion problem

Cites Work

Capacitated \(p\)-center problem with failure foresight
An integer programming approach for solving the \(p\)-dispersion problem
Double bound method for solving the \(p\)-center location problem
When centers can fail: a close second opportunity
Good solutions to discrete noxious location problems via metaheuristics
Single-allocation ordered median hub location problems
Cover and pack inequalities for (mixed) integer programming
Tabu search and GRASP for the maximum diversity problem
The discrete p-dispersion problem
The equitable dispersion problem
A flexible model and efficient solution strategies for discrete location problems
GRASP and path relinking for the max-min diversity problem
Computational aspects of the maximum diversity problem
A new compact formulation for the discrete \(p\)-dispersion problem
Facility dispersion problems under capacity and cost constraints
The stratified \(p\)-center problem
Measuring diversity. A review and an empirical analysis
A branch and bound algorithm for the maximum diversity problem
Hybrid heuristics for the maximum diversity problem
Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
A review on discrete diversity and dispersion maximization from an OR perspective
A New Formulation and Resolution Method for the p-Center Problem
Solving Large p-Median Problems with a Radius Formulation
Comparison Of Four Models For dispersing Facilities
Location on Tree Networks: P-Centre and n-Dispersion Problems
A Canonical Representation of Simple Plant Location Problems and Its Applications
Heuristic algorithms for the maximum diversity problem
Heuristics for the capacitated dispersion problem

This page was built for publication: Formulations and valid inequalities for the capacitated dispersion problem