{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"Coluna.jl","owner":"atoptima","isFork":false,"description":"Branch-and-Price-and-Cut in Julia","topicNames":["optimization","mixed-integer-programming","column-generation","dantzig-wolfe-decomposition","branch-and-cut-and-price","julia"],"topicsNotShown":0,"allTopics":["optimization","mixed-integer-programming","column-generation","dantzig-wolfe-decomposition","branch-and-cut-and-price","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":8,"issueCount":16,"starsCount":188,"forksCount":43,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-21T16:10:11.231Z"}},{"type":"Public","name":"DynamicSparseArrays.jl","owner":"atoptima","isFork":false,"description":"Dynamic sparse vector and matrix for julia","topicNames":["sparse-matrix","julia"],"topicsNotShown":0,"allTopics":["sparse-matrix","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":4,"starsCount":16,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-26T13:28:37.404Z"}},{"type":"Public","name":"BlockDecomposition.jl","owner":"atoptima","isFork":false,"description":"Extension of JuMP to model decomposable mathematical programs (using Benders or Dantzig-Wolfe decomposition paradigm)","topicNames":["modeling","julia-language","mixed-integer-programming","decomposition-strategies"],"topicsNotShown":0,"allTopics":["modeling","julia-language","mixed-integer-programming","decomposition-strategies"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":1,"starsCount":27,"forksCount":5,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-06T17:55:05.111Z"}},{"type":"Public","name":"ColunaDemos.jl","owner":"atoptima","isFork":false,"description":"Toy demos for continuous integration tests of Coluna.jl","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":7,"forksCount":5,"license":"Mozilla Public License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-18T07:52:47.657Z"}},{"type":"Public","name":"PisingerKnapsack.jl","owner":"atoptima","isFork":false,"description":"Julia interface for Pisinger's algorithms","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":3,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-15T18:04:10.715Z"}},{"type":"Public archive","name":"RichVehicleRoutingProblem.jl","owner":"atoptima","isFork":false,"description":"Package to solve Rich Vehicle Routing problems given a formatted input file and a solver specification.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-04-29T12:50:15.354Z"}}],"repositoryCount":6,"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"}