- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783642260612
9783642040382
- Maße
-
24 cm
- Umfang
-
XVI, 329 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturangaben
- Erschienen in
-
Studies in computational intelligence ; Vol. 250
- Schlagwort
-
Optimierung
Suchverfahren
Soft Computing
- Ereignis
-
Veröffentlichung
- (wo)
-
Berli, Heidelberg
- (wer)
-
Springer
- (wann)
-
2009
- Beteiligte Personen und Organisationen
- 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: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
- Chiong, Raymond
- Springer
Entstanden
- 2009
Ähnliche Objekte (12)
Scheduling and Packing Under Uncertainty
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Hybrid planning & scheduling
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Multiple strip packing and scheduling parallel jobs in platforms
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Scheduling and Packing Under Uncertainty
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Hybrid planning & scheduling
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Multiple strip packing and scheduling parallel jobs in platforms
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Scheduling and Packing Under Uncertainty
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Hybrid planning & scheduling
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Multiple strip packing and scheduling parallel jobs in platforms
Approximation algorithms for 2-dimensional packing and related scheduling problems