The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. The bin packing is being analysed in managment, computers, mathematics and researches of operations. The quality of the heuristic structural algorithm and time have been analysed in the work (the percent of the used material and the quality of the received waste). The results of the researches show that non-sorted bin packing algorithms cut better than bin packing sorted algorithms but the time of cutting grows longer when the number of finished products grow longer.Švietimo akademijaVytauto Didžiojo universiteta
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
Opisani su i analizirani osnovni egzaktni, heuristički i aproksimativni algoritmi za Bin-packing pro...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
Due to the character of the original source materials and the nature of batch digitization, quality ...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
We have tried to create a bin-packing algorithm that assigns items from a customer-order to totes su...
Bin packing and bin covering are important optimization problems in many industrial fields, such as ...
Tato bakalářská práce se zabývá problematikou dvojdimenzionálního obdélníkového Bin Packing Problemu...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
none3siWe review the most important mathematical models and algorithms developed for the exact solut...
We present novel exact and approximate methods for solving bin packing and related problems, which s...
Background: Bin packing is an NPhard optimization problem of packing items of given sizes into minim...
The Bin Packing problem is a well-known and highly investigated problem in the computer science: we ...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
Opisani su i analizirani osnovni egzaktni, heuristički i aproksimativni algoritmi za Bin-packing pro...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
Due to the character of the original source materials and the nature of batch digitization, quality ...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
We have tried to create a bin-packing algorithm that assigns items from a customer-order to totes su...
Bin packing and bin covering are important optimization problems in many industrial fields, such as ...
Tato bakalářská práce se zabývá problematikou dvojdimenzionálního obdélníkového Bin Packing Problemu...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
none3siWe review the most important mathematical models and algorithms developed for the exact solut...
We present novel exact and approximate methods for solving bin packing and related problems, which s...
Background: Bin packing is an NPhard optimization problem of packing items of given sizes into minim...
The Bin Packing problem is a well-known and highly investigated problem in the computer science: we ...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
Opisani su i analizirani osnovni egzaktni, heuristički i aproksimativni algoritmi za Bin-packing pro...