Search Results for "bin packing"

Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....

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...

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.

Algorithm for 3d bin packing problem

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.

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

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.

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.