Primal and dual bounds for the vertex \(p\)-median problem with balance constraints

DOI10.1007/s10479-016-2255-8zbMath1381.90042OpenAlexW2466040927MaRDI QIDQ1686518

Dolores E. Luna, Juan A. Díaz

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2255-8

zbMATH Keywords

Lagrangean relaxationlocation\(p\)-median

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods of relaxation type (49M20)

Cites Work

• New models for commercial territory design
• Using dual feasible functions to construct fast lower bounds for routing and location problems
• Density based problem space search for the capacitated clustering \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• An effective VNS for the capacitated \(p\)-median problem
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• Optimal political districting
• Two exact algorithms for the capacitated \(p\)-median problem
• A column generation approach to capacitated \(p\)-median problems
• Districting for salt spreading operations
• A simulated annealing genetic algorithm for the electrical power districting problem
• A tabu search heuristic and adaptive memory procedure for political districting
• A dual bounding scheme for a territory design problem
• Political districting: from classical models to recent approaches
• Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• Local search algorithms for political districting
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• A scatter search heuristic for the capacitated clustering problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Solution methods for thep-median problem: An annotated bibliography
• A branch‐and‐price algorithm for the capacitated p‐median problem
• A simulated annealing approach to police district design

This page was built for publication: Primal and dual bounds for the vertex \(p\)-median problem with balance constraints