Solving a continuous multifacility location problem by DC algorithms

The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization methods & software Jg. 37; H. 1; S. 338 - 360
Hauptverfasser:	Bajaj, Anuj, Mordukhovich, Boris S., Nam, Nguyen Mau, Tran, Tuyen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 02.01.2022 Taylor & Francis Ltd
Schlagworte:	Algorithms difference of convex functions Integer programming Mixed integer Mixed integer programming multifacility location Nesterov's smoothing Optimization Site selection the DCA
ISSN:	1055-6788, 1029-4937
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!