Search Results for "bin packing problem"

.... OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. Once you model your problem in your preferred programming language, you can then use any of OR-Tools’ available solvers. OR-Tools is an award-winning project, having won three gold medals in the 2020 MiniZinc Challenge, the international constraint programming competition.

Graphical representation for the 3D BIN PACKING problem using the algorithm (http://www.diku.dk/~pisinger/codes.html). Optimizes the volume of rectangular cubes inside a rectangular containers Displays the result in 3d graphics. Can be used on this website: http://www.3dbinbox.com

Packery is a JavaScript library and jQuery plugin that makes gapless and draggable layouts. It uses a bin-packing algorithm to fill in empty gaps. Packery layouts can be intelligently ordered or organically wild. Elements can be stamped in place, fit in a specific spot, or dragged around. It’s perfect for draggable dashboard and seamless Masonry image galleries. If you want to use Packery to develop commercial sites, themes, projects, and applications, the Commercial license is the appropriate...

SCNURS - Side Cut Non-Uniform Residual Stress measurement method for plates, - is a destructive RS measurement method developed in Moscow, Russia and later in Bristol, UK. The method is specifically designed for the measurement of highly non-uniform RS fields, including discontinuities, in plates. This project collects all codes which implement forward and inverse solution to the RS problem. The codes are in modern Fortran with OpenMP. The codes are distributed under 2-clause BSD license...

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

https://github.com/mhisoft/rdpro

It is simple tool to collect multiple packaging slips and print it in formatted way. Login to your Paypal account, select item which you would like to print, then open link "Print Packing Slip". When you see page loaded use select all combination (ctrl+a) and copy combination (ctrl+c). After that open Paypal Slip printer and paste your selection with ctrl+v and you are done. The software parses all the fields and prepares your slip. You can edit, print or save as PDF your formatted slips. Easy...

This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.

The problem of packing small boxes into a larger box underlies a number of cutting, packing, scheduling, and transportation applications. This solver for the problem, based on integer linear programming relaxations, beats previous work by far.

A framework to enable local authorities to promote and publicise the geographical and political structures of their area and to enable the move to a Self Service approach to providing public services.

dedup util is a lightweight open-source files packing tool. It is based on block-level data de-duplication technology, and can reduce the data capacity to save storage space. The key feature is no block data collsion with md5 hashkey.

Algorithm for 3d bin packing problem

This is a tool that downloads all problems from http://igo.web.infoseek.co.jp/cgi-bin/mondai/mondai.htm and saves them in sgf format. This enables you to use them in your favourite problem solving program such as GoGrinder etc.

Project developed for the "Ottimizzazione Combinatoria" course of the 2009/10 accademic year. The program provides some heuristics for solve an instance of the "Variable Sized Bin Packing" problem.

A simple desktop utility for putting the most amount of files onto a given set of CD/DVDs. Typically known as the Bin Packing or Knapsack problem.

This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.

This project is an attempt to solve 3D Bin Packing Problem. That is basically is packing a set number of boxes to ONE bin. User interface runs on OpenGL using 'Quantum energy' engine which is developed as part of this project.

This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.

French : Projet JAVA, dans le cadre d'un travail de Recherche Opérationelle. Bin-Packing,de fichiers MP3 sur des CDs, avec gestion des conflits

Boxfit is a packaging solution to the Manufacturing and Transport Industry. The software fits objects of smaller size into minimum number of boxes using heuristic 3D - bin packing algorithms.

Constrained apollonian packing. Given radii {r(i)} and domain D, find the distribution of non-overlapping spheres of radii in {r(i)} in D which most completely fills the domain D (problem shows up in e.g. determining cement grain distributions)