A branch-and-price algorithm for the capacitated p-median problem

Authors:
Alberto Ceselli;Giovanni Righini
Affiliations:
Dipartimento di Technologie dell'Informazione, Università degli Studi di Milano, via Bramante 65, 26013 Crema, Italy;Dipartimento di Technologie dell'Informazione, Università degli Studi di Milano, via Bramante 65, 26013 Crema, Italy
Venue:
Networks
Year:
2005

Citing 0
Cited 9

A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem

Operations Research
A computational study of exact knapsack separation for the generalized assignment problem

Computational Optimization and Applications
A novel grouping heuristic algorithm for the switch location problem based on a hybrid dual harmony search technique

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem

Computers and Industrial Engineering
A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

Computers and Operations Research
Experiments with a generic dantzig-wolfe decomposition for integer programs

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
A hybrid metaheuristic approach for the capacitated p-median problem

Applied Soft Computing
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The capacitated p-median problem is the variation of the well-known p-median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We present a branch-and-price algorithm, that exploits column generation, heuristics and branch-and-bound to compute optimal solutions. We compare our branch-and-price algorithm with other methods proposed so far, and we present computational results both on test instances taken from the literature and on random instances with different values of the ratio between the number of medians and the number of users. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(3), 125–142 2005