{"payload":{"header_redesign_enabled":false,"results":[{"id":"82381951","archived":false,"color":"#f34b7d","followers":13,"has_funding_file":false,"hl_name":"leotac/ELPP-IP","hl_trunc_description":"Solving Elementary Longest/Shortest Path problems with Integer Programming","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":82381951,"name":"ELPP-IP","owner_id":1311290,"owner_login":"leotac","updated_at":"2017-03-08T23:27:07.297Z","has_issues":true}},"sponsorable":false,"topics":["optimization","shortest-paths","cplex","operations-research","longest-path","branch-and-cut","integer-programming","elementary-shortest-path"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":83,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aleotac%252FELPP-IP%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/leotac/ELPP-IP/star":{"post":"sS_VcwIYCz1M0Oj1M351d555xuKtnv6OdHInIw9pfpnAAhmTaKAZ6OMMlfgwK7BQH5w4_NovnU5ylg7s5zVIEQ"},"/leotac/ELPP-IP/unstar":{"post":"LEKT_XT-wvzCshanRKQ6j5AxlWWeNiuxDETSFHD3xd8S3cRDe9u3L9ZnneHkmsEcD3RuWATlVQ2ABrYXTLdrCQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"D6dQ2rnmbEuZijsgYbwBT0OrRhF9TNNqCxi4QmCObeiedUqZai6MsoVwJIizvKMNsei2RJ6-gtKCUIKBdxMYvQ"}}},"title":"Repository search results"}