- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1099-1425
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Packing-based branch-and-bound for discrete malleable task scheduling ; volume:25 ; number:6 ; day:22 ; month:9 ; year:2022 ; pages:675-704 ; date:12.2022
Journal of scheduling ; 25, Heft 6 (22.9.2022), 675-704, 12.2022
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10951-022-00750-w
- URN
-
urn:nbn:de:101:1-2023011509154992823669
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:23 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
- Braune, Roland
- SpringerLink (Online service)
Ähnliche Objekte (12)
Branch-and-Bound Algorithms for Stochastic Resource-Constrained Project Scheduling
Scheduling and Packing Under Uncertainty
Branch-and-bound and truncated branch-and-bound procedures for resource constrained project scheduling with discounted cash flows and general temporal constraints
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Discrete optimal control with dynamic switches : outer approximation and branch-and-bound
Exploring Optimal Pump Scheduling in Water Distribution Networks with Branch and Bound Methods
Improved Cardinality Bounds for Rectangle Packing Representations
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Ein Scheduling-Problem: Strukturuntersuchungen und ein Branch-and-Bound-Algorithmus mit verbesserten unteren Schranken
Branch-and-Bound Algorithms for Stochastic Resource-Constrained Project Scheduling
Scheduling and Packing Under Uncertainty
Branch-and-bound and truncated branch-and-bound procedures for resource constrained project scheduling with discounted cash flows and general temporal constraints
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Discrete optimal control with dynamic switches : outer approximation and branch-and-bound
Exploring Optimal Pump Scheduling in Water Distribution Networks with Branch and Bound Methods
Improved Cardinality Bounds for Rectangle Packing Representations
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Ein Scheduling-Problem: Strukturuntersuchungen und ein Branch-and-Bound-Algorithmus mit verbesserten unteren Schranken
Branch-and-Bound Algorithms for Stochastic Resource-Constrained Project Scheduling
Scheduling and Packing Under Uncertainty
Branch-and-bound and truncated branch-and-bound procedures for resource constrained project scheduling with discounted cash flows and general temporal constraints
Approximation algorithms for packing and scheduling problems
Scheduling and Packing Problems : Algorithms and Complexity
Discrete optimal control with dynamic switches : outer approximation and branch-and-bound
Exploring Optimal Pump Scheduling in Water Distribution Networks with Branch and Bound Methods
Improved Cardinality Bounds for Rectangle Packing Representations
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems