Hochschulschrift
The multiple traveling salesperson problem with moving targets
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
ii, 107 Seiten
- Sprache
-
Englisch
- Anmerkungen
-
Illustrationen
Brandenburgische Technische Universität Cottbus-Senftenberg, Dissertation, 2022
- Erschienen in
-
Cottbus mathematical preprints ; # 26 (2022)
- Klassifikation
-
Mathematik
- Schlagwort
-
Competitive analysis
Travelling-salesman-Problem
- Ereignis
-
Veröffentlichung
- (wo)
-
Cottbus
- (wer)
-
Brandenburgische Technische Universität Cottbus-Senftenberg, Fakultät 1, MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik, Institut für Mathematik
- (wann)
-
[2022]
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:07 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.
Objekttyp
- Hochschulschrift
Beteiligte
- Stieber, Anke
- Brandenburgische Technische Universität Cottbus-Senftenberg, Fakultät 1, MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik, Institut für Mathematik
Entstanden
- [2022]
Ähnliche Objekte (12)
The multiple traveling salesperson problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Dealing with time in the multiple traveling salesmen problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Bistable traveling waves under discretization: moving meshes
Efficient approximations for many-visits multiple traveling salesman problems
The traveling salesman problem
The Traveling Salesman Problem
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Das Traveling-Salesman-Problem, [1]
Keeping track of moving targets
Moving targets in drug discovery
The multiple traveling salesperson problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Dealing with time in the multiple traveling salesmen problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Bistable traveling waves under discretization: moving meshes
Efficient approximations for many-visits multiple traveling salesman problems
The traveling salesman problem
The Traveling Salesman Problem
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Das Traveling-Salesman-Problem, [1]
Keeping track of moving targets
Moving targets in drug discovery
The multiple traveling salesperson problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Dealing with time in the multiple traveling salesmen problem with moving targets
Dealing with time in the multiple traveling salespersons problem with moving targets
Bistable traveling waves under discretization: moving meshes
Efficient approximations for many-visits multiple traveling salesman problems
The traveling salesman problem
The Traveling Salesman Problem
Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems
Das Traveling-Salesman-Problem, [1]
Keeping track of moving targets