3d-bin-packing
Use the minimum number of bins to pack items with different dimensions, weights and properties.
- 151
- Python
- Apache-2.0
- 7 mo ago
dwave-examples
D-Wave Ocean code examples
Built from dwave-examples's public GitHub profile. Not on Take My Repo yet, so there are no posts or updates here.
Use the minimum number of bins to pack items with different dimensions, weights and properties.
Determine where to place new charging stations on a map based on locations of existing charging stations and points of interest.
Solve different formulations of the portfolio optimization problem.
Find an optimal assignment for a group of nurses, under constraints of scheduling and personnel.
Determine which items to include in a knapsack to maximize total value, subject to a capacity.
Split a network into two groups, maximizing the number of cut edges.
Group satellites into constellations such that their average observation coverage is maximized
Schedule employees subject to employee availability, forecasted shift requirements, and manager and trainee constraints.
Use mutual information to select features in a Titanic data set
A template for code examples on this account. See for details on contribution guidelines.
Demo for analyzing the structural imbalance on a signed social network.
Machine Learning MNIST training and image generation using a DVAE and GRBM.
Split a graph into two groups such that there are as few edges as possible between groups.
Capacitated Vehicle Routing Problem example on D-Wave's hybrid solvers.
Minimize messaging between computers in a distributed computing system by using the LeapHybridCQMSampler. This problem is also known as the graph k-partitioning problem.
Choose a set of antennas to maximize antenna coverage without any overlapping coverage.
Choose features that promote diversity and strong relationships to the target variable.
Determine a schedule for running a set of jobs on a certain number of machines.