Search Results for "bin packing problem"
Sort By:
Showing 24 open source projects for "bin packing problem"
View related business solutions-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
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.... -
2
Recuva
Recover your deleted files quickly and easily.
Accidentally deleted an important file? Lost files after a computer crash? No problem - Recuva recovers files from your Windows computer, recycle bin, digital camera card, or MP3 player! -
3
HAC Ada Compiler
HAC Ada Compiler - small Ada compiler fully in Ada
HAC - HAC Ada Compiler - is a small, quick, open-source Ada compiler, covering a subset of the Ada language. HAC is perhaps the first open-source (albeit partial) Ada compiler fully programmed in Ada itself. More information on: http://hacadacompiler.sf.net For an editor integrated with HAC, check LEA: https://l-e-a.sf.net/ Pre-built binary for Windows: https://sf.net/projects/hacadacompiler/files/hac-2024-03-21-v.0.30-bin-win64.zip Alire crate: https://alire.ada.dev/crates/hac Mirror:... -
4
Multi-Agent Emergence Environments
Environment generation code for the paper "Emergent Tool Use"
multi-agent-emergence-environments is an open source research environment framework developed by OpenAI for the study of emergent behaviors in multi-agent systems. It was designed for the experiments described in the paper and blog post “Emergent Tool Use from Multi-Agent Autocurricula”, which investigated how complex cooperative and competitive behaviors can evolve through self-play. The repository provides environment generation code that builds on the mujoco-worldgen package, enabling... -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
scnu
Fortran codes for SCNURS method - Side Cut Non-Uniform Residual Stress
...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. The code uses Lapack (http://netlib.org/lapack), Slatec (http://www.netlib.org/slatec) and CMLIB (http://gams.nist.gov/cgi-bin/serve.cgi/Package/CMLIB) libraries. All these libraries are available as packages on FreeBSD. -
6
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
-
7
Packery
Gapless, draggable grid layouts
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 license. ... -
8
popt4jlib
Parallel Optimization Library for Java
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... -
9
Recursive Directory Removal
Recursive Directory Removal
https://github.com/mhisoft/rdpro -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
10
Paypal Slip Printer
Improve your packaging performance with Paypal Slip printer
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 and fast. Enjoy! ... -
11
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
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. -
12
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.
-
13
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.
-
14
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.
-
15
-
16
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.
-
17
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.
-
18
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.
-
19
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.
-
20
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.
-
21
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.
-
22
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
-
23
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.
-
24
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)
- Previous
- You're on page 1
- Next
