Polyhedral Analysis of Uncapacitated Single Allocation p-Hub Center Problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Report in Wirtschaftsmathematik (WIMA Report) ; 109
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Technische Universität Kaiserslautern, Fachbereich Mathematik
- (wann)
-
2007
- Urheber
- URN
-
urn:nbn:de:hbz:386-kluedo-14927
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
18.08.2024, 05:21 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Jütte, Silke
- Gavriliouk, Elena
- Hamacher, Horst
- Technische Universität Kaiserslautern, Fachbereich Mathematik
Entstanden
- 2007
Ähnliche Objekte (12)
Polyhedral Analysis of Hub Center Problems
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Single-allocation hub location problems with capacity choices
The uncapacitated hub location problem : polyhedral analysis and applications
Recoverable robust single machine scheduling with polyhedral uncertainty
Dynamic Hub Location Problems with Single Allocation and Multiple Capacity Levels
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Polyhedral inclusion-exclusion
Nesting of multiple polyhedral plasmonic nanoframes into a single entity
The capacitated single-allocation hub location problem revisited: A note on a classical formulation
Hub Cover and Hub Center Problems
Polyhedral Analysis of Hub Center Problems
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Single-allocation hub location problems with capacity choices
The uncapacitated hub location problem : polyhedral analysis and applications
Recoverable robust single machine scheduling with polyhedral uncertainty
Dynamic Hub Location Problems with Single Allocation and Multiple Capacity Levels
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Polyhedral inclusion-exclusion
Nesting of multiple polyhedral plasmonic nanoframes into a single entity
The capacitated single-allocation hub location problem revisited: A note on a classical formulation
Hub Cover and Hub Center Problems
Polyhedral Analysis of Hub Center Problems
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
Single-allocation hub location problems with capacity choices
The uncapacitated hub location problem : polyhedral analysis and applications
Recoverable robust single machine scheduling with polyhedral uncertainty
Dynamic Hub Location Problems with Single Allocation and Multiple Capacity Levels
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Polyhedral inclusion-exclusion
Nesting of multiple polyhedral plasmonic nanoframes into a single entity
The capacitated single-allocation hub location problem revisited: A note on a classical formulation