Add to ORKGAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel W 1060 (7) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
One of the biggest challenges facing by logistics companies is the packing of fragile products in co...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
Tato bakalářská práce se zabývá problematikou dvojdimenzionálního obdélníkového Bin Packing Problemu...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to ...
We review the most important mathematical models and algorithms developed for the exact solution of ...
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algo...
The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. Th...
The Bin Packing problem is a well-known and highly investigated problem in the computer science: we ...
We present novel exact and approximate methods for solving bin packing and related problems, which s...
This document describes new models and methodologies that we apply to three families of packing prob...
The multi-level bin packing problem (MLBP) and its variant problem with partial orders (MLBPPO) are ...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
One of the biggest challenges facing by logistics companies is the packing of fragile products in co...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
Tato bakalářská práce se zabývá problematikou dvojdimenzionálního obdélníkového Bin Packing Problemu...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to ...
We review the most important mathematical models and algorithms developed for the exact solution of ...
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algo...
The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. Th...
The Bin Packing problem is a well-known and highly investigated problem in the computer science: we ...
We present novel exact and approximate methods for solving bin packing and related problems, which s...
This document describes new models and methodologies that we apply to three families of packing prob...
The multi-level bin packing problem (MLBP) and its variant problem with partial orders (MLBPPO) are ...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
One of the biggest challenges facing by logistics companies is the packing of fragile products in co...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
Tato bakalářská práce se zabývá problematikou dvojdimenzionálního obdélníkového Bin Packing Problemu...