- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1613-9178
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A hybrid evolutionary algorithm for the offline Bin Packing Problem ; day:15 ; month:7 ; year:2020 ; pages:1-21
Central European journal of operations research ; (15.7.2020), 1-21
- Creator
-
Borgulya, Istvan
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10100-020-00695-5
- URN
-
urn:nbn:de:101:1-2020091119084756548355
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:44 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Borgulya, Istvan
- SpringerLink (Online service)
Other Objects (12)
A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Interactive evolutionary computation with minimum fitness evaluation requirement and offline algorithm design
A GAN-based genetic algorithm for solving the 3D bin packing problem
Efficient 1-Space Bounded Hypercube Packing Algorithm
A 2-approximation for 2D bin packing.
Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem
New approximability results for two-dimensional bin packing
Eine Heuristik für das mehrdimensionale Bin Packing Problem
Parallel Online Algorithms for the Bin Packing Problem
Best Fit Bin Packing with Random Order Revisited
Streaming Algorithms for Bin Packing and Vector Scheduling
Tight Approximation for Resource Constrained Scheduling and Bin Packing
A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Interactive evolutionary computation with minimum fitness evaluation requirement and offline algorithm design
A GAN-based genetic algorithm for solving the 3D bin packing problem
Efficient 1-Space Bounded Hypercube Packing Algorithm
A 2-approximation for 2D bin packing.
Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem
New approximability results for two-dimensional bin packing
Eine Heuristik für das mehrdimensionale Bin Packing Problem
Parallel Online Algorithms for the Bin Packing Problem
Best Fit Bin Packing with Random Order Revisited
Streaming Algorithms for Bin Packing and Vector Scheduling
Tight Approximation for Resource Constrained Scheduling and Bin Packing
A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Interactive evolutionary computation with minimum fitness evaluation requirement and offline algorithm design
A GAN-based genetic algorithm for solving the 3D bin packing problem
Efficient 1-Space Bounded Hypercube Packing Algorithm
A 2-approximation for 2D bin packing.
Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem
New approximability results for two-dimensional bin packing
Eine Heuristik für das mehrdimensionale Bin Packing Problem
Parallel Online Algorithms for the Bin Packing Problem
Best Fit Bin Packing with Random Order Revisited
Streaming Algorithms for Bin Packing and Vector Scheduling