Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 139 for “"Bin Packing"”.

  1. Generalized Bin Packing Problems

    Packing problems make up a fundamental topic of combinatorial optimization. Their importance is confirmed both by their wide range of scientific and technological applications they are able to address and by their theoretical implications. In fact, they are exploited in many fields such as computer …

    poli-torino Repository record for Generalized Bin Packing Problems (opens in a new tab)

  2. Combinatorial Bin Packing Problems

    … the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. …

    arizona-thes Repository record for Combinatorial Bin Packing Problems (opens in a new tab)

  3. Analysis of bin packing variants

    The Bin Packing problem is a classic and widely studied optimization problem that arises naturally in applications like manufacturing, logistics, and memory allocation, where space and resource constraints are critical. In this thesis, we first demonstrate the NP-completeness of Bin Packing via a …

    unf Repository record for Analysis of bin packing variants (opens in a new tab) Download PDF for Analysis of bin packing variants (opens in a new tab)

  4. Cloud storage and online bin packing

    … are random. The work here is related to "bin packing", a well studied problem in theoretical computer science. As an aside the thesis will survey some of the literature related to bin packing.

    unlv Repository record for Cloud storage and online bin packing (opens in a new tab) Download PDF for Cloud storage and online bin packing (opens in a new tab)

  5. Approximation algorithms for multidimensional bin packing

    The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so …

    gatech Repository record for Approximation algorithms for multidimensional bin packing (opens in a new tab)

  6. ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM

    … a software system for the Incremental Rectangle Packing Problem. The general bin-packing problem is the problem of packing a collection of objects (of any dimension) into well-defined regions (called bins) such that they do not overlap, The overall aim is to maximise the utilization of the space …

    nus Repository record for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab) Download file for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab)

  7. Simulation of Online Bin Packing in Practice

    The bin packing problem requires packing a set of objects into a finite number of bins of fixed capacity in a way that minimizes the number of bins used. We consider the online version of the problem where items arrive over tine and a decision has to be made as soon as an element is available. …

    unlv Repository record for Simulation of Online Bin Packing in Practice (opens in a new tab) Download PDF for Simulation of Online Bin Packing in Practice (opens in a new tab)

  8. PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS

    Bin-packing problems appear in many applications. Since the general form of bin-packing problems is NP-hard, emphasis is placed on the study of heuristic algorithms. To compare the performance of heuristic algorithms, their average-case performance is an appropriate measure when the input of these …

    nus Repository record for PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS (opens in a new tab) Download file for PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS (opens in a new tab)

  9. Three-dimensional Bin Packing in Mixed-case Palletization

    The Three Dimensional Bin Packing Problem (3DBPP) is within one of the broad categories of the Bin Packing Problem. The other broad categories include the One Dimensional and the Two Dimensional Bin Packing Problem. As we live in a three dimensional world, the 3DBPP can model a variety of real …

    waterloo Repository record for Three-dimensional Bin Packing in Mixed-case Palletization (opens in a new tab)

  10. Applications and extensions of the bin packing problem

    Bin packing is a classic optimization problem with many applications and variants. In its basic form, the goal is to pack items of different sizes in the range (0,1] into the minimum number of unit capacity bins. In doing so, an "offline" algorithm has access to all items before packing them, while …

    manitoba Repository record for Applications and extensions of the bin packing problem (opens in a new tab)

  11. Bin packing, number balancing, and rescaling linear programs

    … for a classical NP-complete problem, the bin packing problem. In this problem, the goal is to pack items of sizes $s_i\in [0,1]$ into as few bins as possible, where a set of items fits into a bin provided the sum of the item sizes is at most one. We give a polynomial-time rounding scheme …

    washington Repository record for Bin packing, number balancing, and rescaling linear programs (opens in a new tab)

  12. A Branch-and-Price Algorithm for Bin Packing Problem

    Bin Packing Problem examines the minimum number of identical bins needed to pack a set of items of various sizes. Employing branch-and-bound and column generation usually requires designation of the problem-specific branching rules compatible with the nature of the pricing sub-problem of column …

    york Repository record for A Branch-and-Price Algorithm for Bin Packing Problem (opens in a new tab)

  13. Multi-objective optimisation of the generalized bin packing problem

    … multi-objective optimisation of the generalized bin packing problem, which involves the allocation of compulsory and non-compulsory items into a set of bins. The items have characteristics such as weight, width, height, and due date, while the bins have characteristics such as capacity and cost. …

    cape-town Repository record for Multi-objective optimisation of the generalized bin packing problem (opens in a new tab)

  14. Algorithms for Timely Bin Packing, Fair TCP Acknowledgement, and Variants

    The Timely Bin Packing problem is a variant of bin packing, which incorporates time constraints for packing items. This is related to the classic Dynamic TCP Acknowledgement problem, which has been extensively studied and has real-world applications. This thesis studies new algorithms and settings …

    york Repository record for Algorithms for Timely Bin Packing, Fair TCP Acknowledgement, and Variants (opens in a new tab)

  15. An Algorithm for Crew Scheduling Problem with Bin Packing Features

    … The crew scheduling problem is solved with a bin packing approach in polynomial time. Based on the extensive research on the bin packing problem during the past 40 years, an algorithm that is proved to be the most efficient for solving most bin packing problems is selected and modified for …

    maryland Repository record for An Algorithm for Crew Scheduling Problem with Bin Packing Features (opens in a new tab)

  16. Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

    The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The …

    vt Repository record for Asymptotic Worst-Case Analyses for the Open Bin Packing Problem (opens in a new tab)

  17. Instance space analysis for the generalized bin packing problem algorithms

    Instance space analysis for the generalized bin packing problem algorithms In the generalised bin packing problem, the objective is to pack a selected set of profitable non-compulsory items with all the compulsory ones into a set of bins such that the resulting packing cost is minimised. The total …

    cape-town Repository record for Instance space analysis for the generalized bin packing problem algorithms (opens in a new tab)

  18. The Bin Packing Problem with Fragile Objects: Models and Solution Methods

    The Bin Packing Problem (BPP) is an important optimization problem with many applications. Given a set of items with a certain weight and a set of bins with fixed capacity, the classical BPP seeks to pack the items into the minimum number of bins. In this thesis a variant of the BPP, the Bin …

    waterloo Repository record for The Bin Packing Problem with Fragile Objects: Models and Solution Methods (opens in a new tab)

Page 1 of 7