Showing 1 - 20 results of 228 for search '"packing problems"', query time: 0.71s Refine Results
  1. 1

    Exact algorithms for the rectilinear block packing problem by Ken MATSUSHITA, Yannan HU, Hideki HASHIMOTO, Shinji IMAHORI, Mutsunori YAGIURA

    Published 2018-07-01
    “…The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container with fixed width and unrestricted height. …”
    Get full text
    Article
  2. 2
  3. 3

    An efficient constructive heuristic for the rectangular packing problem with rotations. by Xusheng Zhao, Yunqing Rao, Peng Qi, Qianhang Lyu, Piaoruo Yang, Shoubo Yu

    Published 2023-01-01
    “…The rectangular packing problem has been extensively studied over the years due to its wide application in industry. …”
    Get full text
    Article
  4. 4

    Two-dimensional irregular packing problems: A review by Baosu Guo, Baosu Guo, Yu Zhang, Jingwen Hu, Jinrui Li, Fenghe Wu, Fenghe Wu, Qingjin Peng, Quan Zhang

    Published 2022-08-01
    “…Research on 2D irregular packing problems is essential for improving material utilization and industrial automation. …”
    Get full text
    Article
  5. 5

    Convex Maximization Formulation of General Sphere Packing Problem by R. Enkhbat

    Published 2020-03-01
    Subjects: “…sphere packing problem…”
    Get full text
    Article
  6. 6

    Methodology to Solve Multi-Dimentional Sphere Packing Problems by Georgiy N. Yaskov

    Published 2019-03-01
    “…According to the international classification, this problem belongs to Sphere Packing Problems (SPPs). The problem is to pack a set of spheres (circles, hyperspheres) with given radii into a container with given metric characteristics. …”
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    Solving the two-dimensional packing problem with m-M calculus by Savić Aleksandar, Šukilović Tijana, Filipović Vladimir

    Published 2011-01-01
    “…This paper considers the two dimensional rectangular packing problem. The mathematical formulation is based on the optimization of a non-linear function with piecewise linear constraints with a small number of real variables. …”
    Get full text
    Article
  10. 10

    A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint by Chen Huan, Ye Furong, Si Yain-Whar

    Published 2016-01-01
    “…This paper considers a two-dimensional orthogonal strip packing problem. Until now some exact algorithm and mainly heuristics were proposed for two-dimensional orthogonal strip packing problem. …”
    Get full text
    Article
  11. 11

    A hybrid approach of simulation and metaheuristic for the polyhedra packing problem by Germán Fernando Pantoja-Benavides, David Álvarez-Martínez

    Published 2022-01-01
    “…This document presents a simulation-based method for the polyhedra packing problem (PPP). This problem refers to packing a set of irregular polyhedra (convex and concave) into a cuboid with the objective of minimizing the cuboid’s volume, considering non-overlapping and containment constraints. …”
    Get full text
    Article
  12. 12
  13. 13

    State-of-the-art review on 3D bin packing problems by Avataram Venkatavaradan Prituja

    Published 2021
    “…This dissertation provides a comprehensive review of the state-of-the-art literature related to 3-D bin packing problems. The main purpose is twofold. First, to identify the strengths and weaknesses of the contributions in the literature. …”
    Get full text
    Thesis-Master by Coursework
  14. 14

    A Genetic Algorithm for Two-Dimensional Bin Packing Problem by Lee, Lai Soon

    Published 2008
    “…This paper considers a non-oriented twodimensional bin packing problem, where a set of small rectangles, which may be rotated by 90°, has to be allocated to one or more identical bins. …”
    Get full text
    Article
  15. 15

    Heuristic placement routines for two-dimensional bin packing problem. by Wong, L., Lee, Lai Soon

    Published 2009
    “…Problem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem where the general objective is to reduce the production costs by maximizing the utilization of the larger objects and minimizing the material used. …”
    Get full text
    Article
  16. 16
  17. 17

    Dynamic Programming Algorithms with Data Rounding for Combinatorial Food Packing Problems by Yoshiyuki KARUNO, Kazushi TAKAHASHI, Atsushi YAMADA

    Published 2013-03-01
    “…The lexicographic bi-criteria combinatorial food packing problem to be discussed in this paper is described as follows. …”
    Get full text
    Article
  18. 18

    A colloidal viewpoint on the sausage catastrophe and the finite sphere packing problem by Susana Marín-Aguilar, Fabrizio Camerin, Stijn van der Ham, Andréa Feasson, Hanumantha Rao Vutukuri, Marjolein Dijkstra

    Published 2023-11-01
    “…Here, our combined experimental and simulation study provides a physical realization of the finite sphere packing problem by studying arrangements of colloids in a flaccid lipid vesicle. …”
    Get full text
    Article
  19. 19

    An experimental comparison of some heuristics for cardinality constrained bin packing problem by Maja Remic, Gašper Žerovnik, Janez Žerovnik

    Published 2012-01-01
    Subjects: “…cardinality constrained bin packing problem heuristics…”
    Get full text
    Article
  20. 20