Das Ziel dieser Arbeit ist es, verschiedene Möglichkeiten zur Bestimmung geeigneter Standorte anzugeben, wobei eine Restriktion an den zulässigen Bereich in Form einer linearen Barriere in die Modellierung einbezogen werden soll. Derartige Problemstellungen wurden in der Literatur bereits für 1–Standortprobleme untersucht, jedoch nicht für den Fall, in dem N > 1 neue Standorte gesucht werden. Solche Modelle – und die dazugehörigen Lösungsverfahren – sollen hier hergeleitet und dann so verallgemeinert werden, dass unterschiedliche Abstandsfunktionen verwendet werden könne.
Excerpt out of 81 pages
- scroll top
Look inside the ebook
-
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X. -
Upload your own papers! Earn money and win an iPhone X.