Primal and dual bounds for the vertex p-median problem with balance constraints
From MaRDI portal
Publication:1686518
Recommendations
- Fast primal and dual heuristics for the \(p\)-median location problem
- Computational study of large-scale p-median problems
- P-median problems with an additional constraint on the assignment variables
- Some heuristic methods for solving p-median problems with a coverage constraint
- scientific article; zbMATH DE number 1247176
Cites work
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated p-median problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A dual bounding scheme for a territory design problem
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A scatter search heuristic for the capacitated clustering problem
- A simulated annealing approach to police district design
- A simulated annealing genetic algorithm for the electrical power districting problem
- A tabu search heuristic and adaptive memory procedure for political districting
- An effective VNS for the capacitated \(p\)-median problem
- Density based problem space search for the capacitated clustering p-median problem
- Districting for salt spreading operations
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Local search algorithms for political districting
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- New models for commercial territory design
- Optimal political districting
- Political districting: from classical models to recent approaches
- Solution methods for thep-median problem: An annotated bibliography
- The \(p\)-median problem: a survey of metaheuristic approaches
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Two exact algorithms for the capacitated p-median problem
- Using dual feasible functions to construct fast lower bounds for routing and location problems
This page was built for publication: Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686518)
