- Weitere Titel
-
Kombinatorische Algorithmen für Covering- und Schedulingprobleme
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
München, Technische Universität München, Dissertation, 2021
- Schlagwort
-
Scheduling
Algorithms
- Ereignis
-
Veröffentlichung
- (wo)
-
München
- (wer)
-
Universitätsbibliothek der TU München
- (wann)
-
2021
- Urheber
-
Leichter, Marilena Susan
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bvb:91-diss-20210624-1602044-1-9
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 MEZ
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
- Leichter, Marilena Susan
- Schulz, Andreas S.
- Moseley, Benjamin
- Peis, Britta
- Universitätsbibliothek der TU München
Entstanden
- 2021
Ähnliche Objekte (12)
Sports leagues scheduling : models, combinatorial properties, and optimization algorithms
Combinatorial algorithms for subset sum problems
Fast algorithms for two scheduling problems
Approximation Algorithms for Combinatorial Multicriteria Optimization Problems
Approximation algorithms for packing and scheduling problems
Algorithms for classical and modern scheduling problems
Algorithms for Scheduling Problems and Integer Programming
Algorithms in combinatorial geometry
Improved approximation algorithms for packing and scheduling problems
Scheduling algorithms for parallel processing and buffering problems
Fixed-parameter algorithms for some combinatorial problems in bioinformatics
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Sports leagues scheduling : models, combinatorial properties, and optimization algorithms
Combinatorial algorithms for subset sum problems
Fast algorithms for two scheduling problems
Approximation Algorithms for Combinatorial Multicriteria Optimization Problems
Approximation algorithms for packing and scheduling problems
Algorithms for classical and modern scheduling problems
Algorithms for Scheduling Problems and Integer Programming
Algorithms in combinatorial geometry
Improved approximation algorithms for packing and scheduling problems
Scheduling algorithms for parallel processing and buffering problems
Fixed-parameter algorithms for some combinatorial problems in bioinformatics
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Sports leagues scheduling : models, combinatorial properties, and optimization algorithms
Combinatorial algorithms for subset sum problems
Fast algorithms for two scheduling problems
Approximation Algorithms for Combinatorial Multicriteria Optimization Problems
Approximation algorithms for packing and scheduling problems
Algorithms for classical and modern scheduling problems
Algorithms for Scheduling Problems and Integer Programming
Algorithms in combinatorial geometry
Improved approximation algorithms for packing and scheduling problems
Scheduling algorithms for parallel processing and buffering problems
Fixed-parameter algorithms for some combinatorial problems in bioinformatics