{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"gdplib","owner":"SECQUOIA","isFork":false,"description":"An open library of Generalized Disjunctive Programming (GDP) models","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":8,"issueCount":5,"starsCount":8,"forksCount":7,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-24T19:35:45.717Z"}},{"type":"Public","name":"QUBONotebooks","owner":"SECQUOIA","isFork":false,"description":"QUBO.jl Notebooks","allTopics":["jupyter","notebook","qubo","quantum-optimization"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-02T13:37:33.974Z"}},{"type":"Public","name":"Convexification-based-OA-Benchmark","owner":"SECQUOIA","isFork":false,"description":"Benchmark results of convexification-based OA method","allTopics":["github-pages","benchmark","minlp"],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Creative Commons Zero v1.0 Universal","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-27T00:23:25.243Z"}},{"type":"Public","name":"dsda-gdp","owner":"SECQUOIA","isFork":false,"description":"This repository contains the code for the D-SDA algorithm posed as a disjunctive algorithm implemented for Pyomo.GDP","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":5,"issueCount":1,"starsCount":3,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T00:18:13.160Z"}},{"type":"Public","name":"QUBOLib.jl","owner":"SECQUOIA","isFork":false,"description":"QUBO Instances for benchmarking","allTopics":["benchmark","database","instances","qubo","quantum-optimization"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":2,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-03T03:56:58.151Z"}},{"type":"Public","name":"SECQUOIA.github.io","owner":"SECQUOIA","isFork":false,"description":"Group website","allTopics":[],"primaryLanguage":{"name":"SCSS","color":"#c6538c"},"pullRequestCount":1,"issueCount":4,"starsCount":2,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-21T14:57:32.712Z"}},{"type":"Public","name":"PharmaPy","owner":"SECQUOIA","isFork":true,"description":"A numerical platform for the digital design of pharmaceutical processes","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":14,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-18T20:28:23.880Z"}},{"type":"Public","name":"LD-SDA-Dynamic","owner":"SECQUOIA","isFork":false,"description":"Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-18T19:26:03.617Z"}},{"type":"Public","name":"stochastic-benchmark","owner":"SECQUOIA","isFork":true,"description":"Repository for Stochastic Optimization Solvers Benchmark code","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-20T04:08:52.348Z"}},{"type":"Public","name":"QUBOTools.jl","owner":"SECQUOIA","isFork":true,"description":"🧬 Tools for Quadratic Unconstrained Binary Optimization models in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-16T17:27:22.932Z"}},{"type":"Public","name":"ToQUBO.jl","owner":"SECQUOIA","isFork":true,"description":"🟦 JuMP ToQUBO Automatic Reformulation","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-16T17:26:41.882Z"}},{"type":"Public","name":"DWave.jl","owner":"SECQUOIA","isFork":true,"description":"🌊 D-Wave Quantum Annealing Interface for JuMP","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-19T17:05:42.081Z"}},{"type":"Public","name":"continuous-CIM","owner":"SECQUOIA","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-12T02:30:51.357Z"}},{"type":"Public","name":"QC-Tutorial","owner":"SECQUOIA","isFork":false,"description":"This is the class material for the Quantum Computing Tutorial by SECQUOIA","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":1,"starsCount":1,"forksCount":0,"license":"Creative Commons Zero v1.0 Universal","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-04T00:26:15.479Z"}},{"type":"Public","name":"QUBO.jl","owner":"SECQUOIA","isFork":true,"description":"A Julia Ecosystem for Quadratic Unconstrained Binary Optimization","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-13T18:07:09.745Z"}},{"type":"Public","name":"pyomo-MINLP-benchmarking","owner":"SECQUOIA","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-30T06:41:39.210Z"}},{"type":"Public","name":"QiskitOpt.jl","owner":"SECQUOIA","isFork":true,"description":"JuMP wrapper for IBMQ Optimization Algorithms (ft QUBODrivers.jl)","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-10T16:27:09.010Z"}},{"type":"Public","name":"pyomo-summer-ws","owner":"SECQUOIA","isFork":false,"description":"Pyomo summer workshop 2018 with latest version of Pyomo","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-01T18:53:14.221Z"}},{"type":"Public","name":".github","owner":"SECQUOIA","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-18T15:56:02.958Z"}},{"type":"Public","name":"QUBODrivers.jl","owner":"SECQUOIA","isFork":true,"description":"🔵 Interface and drivers for integrating Solvers and Samplers with the JuMP/MOI ecosystem","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-16T16:42:29.144Z"}},{"type":"Public","name":"copositive-cutting-plane-max-clique","owner":"SECQUOIA","isFork":true,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-06T01:07:33.053Z"}}],"repositoryCount":21,"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"}