Solving the p-Median Problem with a Semi-Lagrangian Relaxation

Authors:
C. Beltran;C. Tadonki;J. Ph. Vial
Affiliations:
Logilab, HEC, University of Geneva, Switzerland;Centre Universitaire Informatique, University of Geneva, Switzerland;Logilab, HEC, University of Geneva, Switzerland
Venue:
Computational Optimization and Applications
Year:
2006

Citing 11
Cited 4

Lagrangean decomposition: A model yielding stronger lagrangean bounds

Mathematical Programming: Series A and B
Integer and combinatorial optimization

Integer and combinatorial optimization
Decomposition and nondifferentiable optimization with the projective algorithm

Management Science
Cluster analysis and mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Matlab guide

Matlab guide
Variable Neighborhood Decomposition Search

Journal of Heuristics
A New Subadditive Approach to Integer Programming

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Practical Algorithm for Computing a Subadditive Dual Function for Set Partitioning

Computational Optimization and Applications
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
The Optimal Diversity Management Problem

Operations Research
A family of facets for the uncapacitated p-median polytope

Operations Research Letters

A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

INOC'11 Proceedings of the 5th international conference on Network optimization
Solving Large p-Median Problems with a Radius Formulation

INFORMS Journal on Computing
An aggregation heuristic for large scale p-median problem

Computers and Operations Research
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We study a modified Lagrangian relaxation which generates an optimal integer solution. We call it semi-Lagrangian relaxation and illustrate its practical value by solving large-scale instances of the p-median problem.