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

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

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-s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications 2006-10, Vol.35 (2), p.239-260
Hauptverfasser: Beltran, C, Tadonki, C, Vial, J Ph
Format: Artikel
Sprache:eng
Schlagworte:
Equality
Integer programming
Optimization
Sensitivity analysis
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-006-6513-6