Katalog der Deutschen Nationalbibliothek

Expertensuche ?

Servicezeiten in Frankfurt am Main ab 1. Dezember 2025: Montag bis Freitag 9–18 Uhr und Samstag 10–16 Uhr
Service hours in Frankfurt am Main from 1 December 2025: Monday to Friday 9:00-18:00 and Saturday 10:00-16:00

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

24. Dezember 2025 bis 1. Januar 2026: Die Deutsche Nationalbibliothek bleibt an beiden Standorten geschlossen. Bestellte Medien werden am 2. Januar 2026 bereitgestellt. // 24 December 2025 to 1 January 2026: The German National Library will be closed at both locations. Ordered media will be made available on 2 January 2026.

Ergebnis der Suche nach: "115843663"
im Bestand: Gesamter Bestand

1 - 10 von 67

	1	Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets Enthalten in OR spectrum 12.2.2024: 1-37
	2	Digital Twins in the Context of Seaports and Terminal Facilities Enthalten in Flexible services and manufacturing journal 13.1.2024: 1-97
	3	Metaheuristics "In the Large" Swan, Jerry. - Freiburg : Universität, 2024
	4	Tiered prediction models for port vessel emissions inventories Enthalten in Flexible services and manufacturing journal 2.10.2022: 1-28
	5	Fixed set search applied to the multi-objective minimum weighted vertex cover problem Enthalten in Journal of heuristics 12.5.2022: 1-28
	6	Revisiting the richness of integrated vehicle and crew scheduling Enthalten in Public transport 23.2.2022: 1-27
	7	Chunking and cooperation in particle swarm optimization for feature selection Enthalten in Annals of mathematics and artificial intelligence 19.7.2021: 1-21
	8	A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals Enthalten in Annals of mathematics and artificial intelligence 1.5.2021: 1-23
	9	Similarity in metaheuristics: a gentle step towards a comparison methodology Enthalten in Natural computing 10.2.2021: 1-23
	10	Optimal Steiner trees under node and edge privacy conflicts Enthalten in Journal of combinatorial optimization 29.1.2021: 1-25