Solve different formulations of the portfolio optimization problem.

Use the minimum number of bins to pack items with different dimensions, weights and properties.

Determine which items to include in a knapsack to maximize total value, subject to a capacity.

Determine a schedule for running a set of jobs on a certain number of machines using the LeapHybridCQMSampler.

Schedule employees subject to employee availability, forecasted shift requirements, and manager and trainee constraints.

Choose a set of antennas to maximize antenna coverage without any overlapping coverage.

Minimize messaging between computers in a distributed computing system by using the LeapHybridCQMSampler. This problem is also known as the graph k-partitioning problem.

Finds the optimal stem configuration of an RNA sequence using the LeapHybridCQMSampler.

Choose features that promote diversity and strong relationships to the target variable.

A demo of graph coloring using Leap's hybrid constrained quadratic model (CQM) solver.

Determine which airports should be hub locations for an airline. Solved using the LeapHybridCQMSampler.

Find the minimal number of immunization doses required to break the transmission cycle of a virus or infectious disease within a population. Solved using the LeapHybridCQMSampler.

Solve cryptarithmetic addition puzzles using the LeapHybridCQMSampler.

Solve the multi-car paint shop optimization problem using the LeapHybridCQMSampler.

Use a hybrid CQM solver to optimize the modes of locomotion for a multi-leg tour

Distribute virtual machines in a way that evenly balances CPU and memory requirements across a set of hosts.