Filters
Show more
Show more
Show more
Show more
Show more
Show more
Show more
Show more
More filters
Results
First Fit bin packing: A tight analysis
In the bin packing problem we are given an instance consisting of a sequence into the smallest possible number of bins of unit size. FirstFit algorithm packs each item ratio of FirstFit bin pa...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Bin Packing And Scheduling with Due Dates
problem is considered as one dimensional packing or knapsack problem, in this pa-per processor capacity is represented by 3D bin packing problem. This research is inspired done by reviewing <...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D
Rok uplatnění
D - Stať ve sborníku
Genetic algorithms for two dimensional bin packing problem
dimensional bin packing problem. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. We propose a new solution of the problem numerous problems
IN - Informatika
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
Lower Bounds for Online Bin Stretching with Several Bins
Online Bin Stretching is a semi-online variant of Bin Packing with a set number of m bins, where all bins can be overpacked to capacity S >= 1, which is to be minimized. There is also a guarantee that an o...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Online bin packing: Old algorithms and new results
In the bin packing problem we are given an instance consisting of a sequence of items with sizes between $0$ and $1$. The objective is to pack these items into the smallest possible number of bins of unit ...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Better Algorithms for Online Bin Stretching
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly overpack the bins. The go...
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Colored Bin Packing: Online Algorithms and Lower Bounds
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of at least two colors and an additional constraint is that we can...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Online Colored Bin Packing
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c }= 2 colors and an additional constraint is that we cannot
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Three-dimensional Bin Packing Problem with heterogeneous batch constraints
on typical three dimensional bin packing problem, where material of bin assigned parts are influencing total production time and total cost of producing these bin pack batches of well-known sol...
Applied mathematics
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Online bin stretching with three bins
Online bin stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goa...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 94 208