• Bison

  • Referenced in 40 articles [sw17681]
  • exactly solving the one-dimensional bin packing problem. In this paper, we consider the well ... known one-dimensional bin packing problem (BPP-1), which is to pack a given...
  • Algorithm 864

  • Referenced in 22 articles [sw05045]
  • variants of the three-dimensional bin packing problem We consider the problem of orthogonally packing ... number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense ... practice. We characterize relevant subclasses of packing and present an algorithm which is able...
  • 2DCPackGen

  • Referenced in 11 articles [sw15617]
  • dimensional rectangular cutting and packing problems. Cutting and packing problems have been extensively studied ... dimensional rectangular cutting and packing problems is proposed. The problems are defined according ... recent typology for cutting and packing problems proposed by G. Wäscher et al. [ibid ... computational experiments run with cutting and packing problems and therefore will help improve the quality...
  • GloMIQO

  • Referenced in 77 articles [sw06266]
  • production. Computational geometry problems formulated as MIQCQP include: point packing, cutting convex shapes from rectangles...
  • Ts2pack

  • Referenced in 14 articles [sw23796]
  • search for the three-dimensional bin packing problem. Three-dimensional orthogonal bin packing ... problem NP-hard in the strong sense where a set of boxes must be orthogonally ... packed into the minimum number of three-dimensional bins. We present a two-level tabu ... search for this problem. The first-level aims to reduce the number of bins...
  • TSpack

  • Referenced in 11 articles [sw15734]
  • search code for multi-dimensional bin packing problems. We present a computer code that implements ... three-dimensional bin packing problems, as well as virtually any of their variants requiring...
  • Packmol

  • Referenced in 15 articles [sw13408]
  • molecular arrangement can be considered a packing problem: Each type molecule must satisfy spatial constraints ... have developed a code able to pack millions of atoms, grouped in arbitrarily complex molecules...
  • BPPLIB

  • Referenced in 10 articles [sw23883]
  • cutting stock problems. The bin packing problem (and its variant, the cutting stock problem ... pointers to relevant articles for these two problems. The library is available ... interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this...
  • UTV

  • Referenced in 263 articles [sw05213]
  • Expansin pack: Special-purpose rank-revealing algorithms. This collection of Matlab 7.0 software supplements ... matrix pair to handle interference-type problems with a rank-deficient covariance matrix...
  • Packlib2

  • Referenced in 9 articles [sw00666]
  • integrated library of multi-dimensional packing problems. We present PackLib 2 , the first fully integrated...
  • Sinc-Pack

  • Referenced in 74 articles [sw13600]
  • Pack – 5. Directory of programs. – Most sections of chapters 1 to 3 contain several problems...
  • Rules2CP

  • Referenced in 5 articles [sw06255]
  • building of Rules2CP libraries for specific problems. The Packing Knowledge Modeling Language PKML is such ... project for higher-dimensional bin packing problems taking into account extra placement constraints and specific...
  • Split Packing

  • Referenced in 4 articles [sw29064]
  • case density. In the classic circle packing problem, one asks whether a given ... circles can be packed into the unit square. This problem is known to be extsf ... cannot be packed, which is why we call this number the problem’s critical density ... context of other packing and covering problems. A browser-based, interactive visualization of the Split...
  • cc(FD)

  • Referenced in 18 articles [sw21237]
  • combinators. Results on numerous problems, including scheduling, resource allocation, sequencing, packing, and hamiltonian paths ... procedural languages on a number of combinatorial problems. In addition, a small cc(FD) program...
  • MinPerim

  • Referenced in 4 articles [sw40493]
  • mixed-integer non-linear pro- gramming model. Packing circles into perimeter-minimizing convex hulls ... solve a new computational geometry optimization problem in which a set of circles with given ... segments and circular arcs. To tackle the problem, we derive a non-convex mixed-integer ... formulation for this circle arrangement or packing problem. Moreover, we present some theoretical insights presenting...
  • VOROPACK-D

  • Referenced in 2 articles [sw40483]
  • algorithm using Voronoi diagram. The disk packing problem (DPP) is to find an arrangement ... instances and in pseudo-realtime for large problem instances. The proposed algorithm, VOROPACK-D, takes ... further enhance a big-disk-first realtime packing solution using the Shrink-and-Shake algorithm ... several orders of magnitude, particularly for large problem instances. Theoretical observations are verified and validated...
  • HyFlex

  • Referenced in 12 articles [sw07688]
  • hard combinatorial problems are fully implemented: maximum satisfiability, one dimensional bin packing, permutation flow shop ... extensive set of state-of-the-art problem specific heuristics and search operators. HyFlex represents...
  • 2DPackLib

  • Referenced in 1 article [sw41681]
  • packing library. Two-dimensional cutting and packing problems model a large number of relevant industrial ... literature on practical algorithms for such problems is very large. We introduce the 2DPackLib ... dimensional orthogonal cutting and packing problems. The library makes available, in a unified format...
  • nilde

  • Referenced in 1 article [sw40073]
  • natural numbers; and one-dimensional bin-packing problem...
  • AxonPacking

  • Referenced in 1 article [sw38407]
  • microstructure. Validation on a theoretical disk packing problem. Reproducible and stable for various densities...