Search results
Jump to navigation
Jump to search
Page title matches
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * It keeps a ''current bin'', which is initially empty. ...6 KB (952 words) - 23:21, 9 September 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi ...''load'' of a bin is defined as the sum of sizes of existing items in the bin before placing the new item. ...4 KB (645 words) - 16:50, 18 December 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * When an item arrives, find the ''first'' bin into which the item can fit, if any. ...14 KB (2,257 words) - 01:28, 29 July 2024
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi The harmonic bin-packing algorithms rely on partitioning the items into categories based on their si ...7 KB (1,140 words) - 12:02, 8 November 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * Open a new empty bin, bin #1. ...11 KB (1,664 words) - 10:50, 12 January 2025
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * Initialize an empty bin and call it the "open bin". ...3 KB (488 words) - 16:27, 18 August 2022
- ..., while the number of items with each size is large. While the general bin-packing problem is [[NP-hard]], the high-multiplicity setting can be solved in poly *''B'' - the bin capacity. ...11 KB (1,746 words) - 00:35, 3 January 2024
- {{short description|Set of related approximation algorithms for the bin packing problem}} ...FCS.1982.61|s2cid=18583908}}</ref> The bin packing problem is a problem of packing items of different sizes into bins of identical capacity, such that the tot ...30 KB (5,319 words) - 20:03, 17 January 2025
Page text matches
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * Initialize an empty bin and call it the "open bin". ...3 KB (488 words) - 16:27, 18 August 2022
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi ...''load'' of a bin is defined as the sum of sizes of existing items in the bin before placing the new item. ...4 KB (645 words) - 16:50, 18 December 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi The harmonic bin-packing algorithms rely on partitioning the items into categories based on their si ...7 KB (1,140 words) - 12:02, 8 November 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * It keeps a ''current bin'', which is initially empty. ...6 KB (952 words) - 23:21, 9 September 2023
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * Open a new empty bin, bin #1. ...11 KB (1,664 words) - 10:50, 12 January 2025
- ..., while the number of items with each size is large. While the general bin-packing problem is [[NP-hard]], the high-multiplicity setting can be solved in poly *''B'' - the bin capacity. ...11 KB (1,746 words) - 00:35, 3 January 2024
- ...s into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possi * When an item arrives, find the ''first'' bin into which the item can fit, if any. ...14 KB (2,257 words) - 01:28, 29 July 2024
- ...iguration'' - each possible [[multiset]] of items that can fit in a single bin (these configurations are also known as ''patterns'') . Usually, the number == In bin packing == ...16 KB (2,489 words) - 04:30, 6 January 2024
- {{short description|Operations research problem of packing items into the largest number of bins}} {{Covering/packing-problem pairs}} ...14 KB (2,336 words) - 09:39, 13 December 2024
- ...the fact that it uses an algorithm for another famous problem - the [[bin packing problem]] - as a subroutine. ...heuristically packs numbers into bins such that the sum of numbers in each bin is at most ''C'', aiming to use as few bins as possible. Multifit runs FFD ...27 KB (4,434 words) - 14:35, 16 February 2025
- {{short description|Set of related approximation algorithms for the bin packing problem}} ...FCS.1982.61|s2cid=18583908}}</ref> The bin packing problem is a problem of packing items of different sizes into bins of identical capacity, such that the tot ...30 KB (5,319 words) - 20:03, 17 January 2025
- ...[[multifit algorithm]]''', using techniques from [[Bin packing problem|bin packing]], which has an approximation factor of 13/11≈1.182. '''Leung<ref>{{Cite journal|date=1989-05-08|title=Bin packing with restricted piece sizes|url=https://www.sciencedirect.com/science/artic ...11 KB (1,569 words) - 13:05, 16 December 2023
- ...y solving a [[knapsack problem]]. This is used by the [[Karmarkar-Karp bin packing algorithms]]. ...9 KB (1,608 words) - 18:13, 20 November 2024
- *The [[bin packing problem]] - a dual problem in which the total sum in each subset is bounded ...ses binary search combined with an algorithm for [[Bin packing problem|bin packing]] . In the worst case, its makespan is at most 8/7 for ''k'' =2, and at mos ...32 KB (5,098 words) - 01:54, 26 January 2024
- ...exity and Inapproximability Results for Parallel Task Scheduling and Strip Packing|journal=Theory of Computing Systems|language=en|volume=64|issue=1|pages=120 ...[[bin packing problem]]: each time-step corresponds to a bin, ''m'' is the bin size, each job corresponds to an item of size ''q<sub>j</sub>'', and minimi ...16 KB (2,509 words) - 14:30, 16 February 2025
- The '''strip packing problem''' is a 2-dimensional geometric minimization problem. ...strip of bounded width and infinite height, determine an overlapping-free packing of the rectangles into the strip, minimizing its height. ...48 KB (7,617 words) - 01:28, 17 December 2024
- ...a= |s2cid=14442594}}</ref>{{Rp|Cor.2}} This has implications for the [[bin packing problem]]. ...5 KB (771 words) - 06:03, 25 September 2024
- ...h is put in a different bin. Since nL ≤ m, when this phase completes, each bin contains at most one item, so the max-sum is at most 1. ...ed into the same bins. Since nM ≤ 2(m-nL), when this phase completes, each bin contains either one large item - with sum at most 1, or at most two medium ...36 KB (5,923 words) - 01:30, 23 April 2024
- *[[Bin covering problem]] and [[Bin packing problem]] - two well-studied optimization problems that can be seen as spec ...47 KB (6,981 words) - 08:34, 21 October 2024
- * [[Bin covering problem]] and [[Bin packing problem]] - two well-studied optimization problems that can be seen as spec ...70 KB (11,064 words) - 12:45, 28 August 2024