{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"employee-scheduling","owner":"dwave-examples","isFork":false,"description":"Schedule employees using a constrained quadratic model with a hybrid solver.","allTopics":["hybrid-solution","cqm","intermediate","optimization"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":4,"starsCount":22,"forksCount":22,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-23T18:03:17.224Z"}},{"type":"Public","name":"nurse-scheduling","owner":"dwave-examples","isFork":false,"description":"A demo of a nurse scheduling model","allTopics":["optimization","constraint-satisfaction-problem","healthcare","hybrid-solution","intermediate","bqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":2,"issueCount":2,"starsCount":42,"forksCount":38,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-12T06:51:31.055Z"}},{"type":"Public","name":"job-shop-scheduling-cqm","owner":"dwave-examples","isFork":false,"description":"Determine a schedule for running a set of jobs on a certain number of machines using the LeapHybridCQMSampler.","allTopics":["manufacturing","hybrid-solution","cqm","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":1,"starsCount":9,"forksCount":20,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T21:00:49.577Z"}},{"type":"Public","name":"mutual-information-feature-selection","owner":"dwave-examples","isFork":false,"description":"Use mutual information to select features in a Titanic data set","allTopics":["beginner","good-first-example","bqm","machine-learning"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":30,"forksCount":30,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-19T16:53:33.718Z"}},{"type":"Public","name":"3d-bin-packing","owner":"dwave-examples","isFork":false,"description":"Use a hybrid solver to use the minimum number of bins to pack items with different dimensions","allTopics":["optimization","mip","hybrid-solution","cqm","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":3,"starsCount":35,"forksCount":22,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-19T16:53:06.345Z"}},{"type":"Public template","name":"template","owner":"dwave-examples","isFork":false,"description":"A template for code examples on this account. See for details on contribution guidelines.","allTopics":["getting-started"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":2,"issueCount":11,"starsCount":25,"forksCount":43,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-28T09:08:44.401Z"}},{"type":"Public","name":"coordinated-multipoint-notebook","owner":"dwave-examples","isFork":false,"description":"Use a quantum computer to decode cellphone signals","allTopics":["optimization","advanced","quantum-computing","qpu"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":2,"starsCount":9,"forksCount":8,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-12T14:20:40.862Z"}},{"type":"Public","name":"tour-planning","owner":"dwave-examples","isFork":false,"description":"Use a hybrid CQM solver to optimize the modes of locomotion for a multi-leg tour","allTopics":["optimization","hybrid","hybrid-solution","cqm","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":10,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-15T13:45:43.299Z"}},{"type":"Public","name":"graph-coloring","owner":"dwave-examples","isFork":false,"description":"A demo of graph coloring using Leap's hybrid constrained quadratic model (CQM) solver.","allTopics":["beginner","hybrid-solution","cqm","good-first-example"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":11,"forksCount":13,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-15T17:25:57.913Z"}},{"type":"Public","name":"feature-selection-cqm","owner":"dwave-examples","isFork":false,"description":"Use a hybrid solver to select features from two data sets","allTopics":["optimization","hybrid-solution","cqm","intermediate","miqp"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":2,"issueCount":1,"starsCount":12,"forksCount":9,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-10T22:42:52.045Z"}},{"type":"Public","name":"sudoku","owner":"dwave-examples","isFork":false,"description":"Solve a Sudoku puzzle with a quantum computer","allTopics":["constraint-satisfaction-problem","hybrid-solution","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":27,"forksCount":44,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-14T19:26:07.671Z"}},{"type":"Public","name":"maximum-cut","owner":"dwave-examples","isFork":false,"description":"Solve a max-cut problem using a quantum computer","allTopics":["optimization","beginner","unconstrained-optimization","good-first-example"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":34,"forksCount":36,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-12T15:27:13.622Z"}},{"type":"Public","name":"reservoir-management","owner":"dwave-examples","isFork":false,"description":"Manage water levels in a reservoir by controlling water pumps.","allTopics":["hybrid-solution","intermediate","bqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":11,"forksCount":14,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-06T15:18:10.059Z"}},{"type":"Public","name":"job-shop-scheduling","owner":"dwave-examples","isFork":false,"description":"Determine a schedule for running a set of jobs.","allTopics":["optimization","constraint-satisfaction-problem","manufacturing","beginner","good-first-example","bqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":3,"starsCount":44,"forksCount":31,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T14:03:48.610Z"}},{"type":"Public","name":"structural-imbalance-notebook","owner":"dwave-examples","isFork":false,"description":"Analyze the structural imbalance on a signed social network. ","allTopics":["optimization","jupyter-notebook","beginner","bqm"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":1,"issueCount":0,"starsCount":6,"forksCount":9,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:29:39.743Z"}},{"type":"Public","name":"structural-imbalance","owner":"dwave-examples","isFork":false,"description":"Demo for analyzing the structural imbalance on a signed social network.","allTopics":["optimization","defense","intermediate","social-network"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":28,"forksCount":26,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:23:35.136Z"}},{"type":"Public","name":"simple-ocean-programs","owner":"dwave-examples","isFork":false,"description":"Examples of introductory Ocean programs and concepts.","allTopics":["getting-started","beginner","good-first-example"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":2,"starsCount":12,"forksCount":24,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:16:35.446Z"}},{"type":"Public","name":"satellite-placement","owner":"dwave-examples","isFork":false,"description":"Group satellites into constellations such that their average observation coverage is maximized","allTopics":["optimization","aerospace","constraint-satisfaction-problem","defense","hybrid-solution","intermediate","bqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":28,"forksCount":28,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:08:02.669Z"}},{"type":"Public","name":"rna-folding","owner":"dwave-examples","isFork":false,"description":"Finds the optimal stem configuration of an RNA sequence using the LeapHybridCQMSampler.","allTopics":["hybrid-solution","cqm","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":14,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:02:15.600Z"}},{"type":"Public","name":"reverse-annealing-notebook","owner":"dwave-examples","isFork":false,"description":"Demonstrates reverse annealing on D-Wave quantum computers. ","allTopics":["advanced","jupyter-notebook","qpu","sampling-distribution","bqm","reverse-annealing"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":7,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T13:00:50.719Z"}},{"type":"Public","name":"qboost","owner":"dwave-examples","isFork":false,"description":"Solve a binary classification problem with Qboost","allTopics":["advanced","bqm","machine-learning"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":24,"forksCount":24,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T12:44:21.343Z"}},{"type":"Public","name":"portfolio-optimization","owner":"dwave-examples","isFork":false,"description":"Solve different formulations of the portfolio optimization problem.","allTopics":["advanced","hybrid-solution","cqm","dqm","finance"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":3,"starsCount":35,"forksCount":27,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T12:09:39.774Z"}},{"type":"Public","name":"pipelines","owner":"dwave-examples","isFork":false,"description":"A minimum vertex problem with pipelines","allTopics":["energy","optimization","constraint-satisfaction-problem","beginner"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":15,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T12:01:59.060Z"}},{"type":"Public","name":"paint-shop-optimization","owner":"dwave-examples","isFork":false,"description":"Solve the multi-car paint shop optimization problem using the LeapHybridCQMSampler.","allTopics":["manufacturing","hybrid-solution","cqm","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":10,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:53:37.369Z"}},{"type":"Public","name":"NAE3SAT","owner":"dwave-examples","isFork":false,"description":"Compare the performance of the Advantage QPU and the Advantage2 prototype on not-all-equal 3-satisfiability problems.","allTopics":["optimization","advanced","bqm","embedding-composite"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":1,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:42:29.053Z"}},{"type":"Public","name":"n-queens","owner":"dwave-examples","isFork":false,"description":"Demonstrates how to formulate the n-queens problem as a QUBO, which we then solve using Leap’s hybrid solvers.","allTopics":["constraint-satisfaction-problem","hybrid-solution","intermediate","bqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":20,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:40:27.432Z"}},{"type":"Public","name":"maze","owner":"dwave-examples","isFork":false,"description":"Simple example on how to construct a problem for a quantum computer","allTopics":["constraint-satisfaction-problem","beginner","good-first-example"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":9,"forksCount":26,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:31:29.535Z"}},{"type":"Public","name":"map-coloring","owner":"dwave-examples","isFork":false,"description":"Select the colors used on the different regions of a map","allTopics":["constraint-satisfaction-problem","beginner","hybrid-solution"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":17,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:19:47.202Z"}},{"type":"Public","name":"knapsack","owner":"dwave-examples","isFork":false,"description":"Implementation of knapsack problem, set up for scaling to large problem size","allTopics":["constraint-satisfaction-problem","beginner","hybrid-solution","cqm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":2,"starsCount":30,"forksCount":39,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:15:29.101Z"}},{"type":"Public","name":"Line-up-optimization","owner":"dwave-examples","isFork":true,"description":"Optimize the initial line-up of Liverpool FC using the LeapHybridSampler.","allTopics":["hybrid-solution","intermediate"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":3,"forksCount":7,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-31T11:08:47.502Z"}}],"repositoryCount":51,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}