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

In this paper the vertex p -median problem with balance constraints is studied (i.e. it is required to group a set of objects into groups, balanced with respect to some measures of activity). A Lagrangean relaxation scheme is proposed to obtain lower bounds and a primal heuristic is proposed to obta...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2017-11, Vol.258 (2), p.613-638
Hauptverfasser:	Díaz, Juan A., Luna, Dolores E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Allocations Business and Management Combinatorics Heuristic Lower bounds Management science Methods Operations research Operations Research/Decision Theory Relaxation methods (Mathematics) S.i.: Claio 2014 Studies Test procedures Theory of Computation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!