Bicriterial and restricted planar 2-Median Problems

  • Efficient algorithms and structural results are presented for median problems with 2 new facilities including the classical 2-Median problem, the 2-Median problem with forbidden regions and bicriterial 2-Median problems. This is the first paper dealing with multi-facility multiobjective location problems. The time complexity of all presented algorithms is O(MlogM), where M is the number of existing facilities.

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Stefan Nickel
URN:urn:nbn:de:hbz:386-kluedo-48794
Series (Serial Number):Preprints (rote Reihe) des Fachbereich Mathematik (242)
Document Type:Report
Language of publication:English
Date of Publication (online):2017/10/18
Year of first Publication:1993
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/18
Page Number:26
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)