{"payload":{"header_redesign_enabled":false,"results":[{"id":"235246045","archived":false,"color":"#f34b7d","followers":77,"has_funding_file":false,"hl_name":"ed-lam/bcp-mapf","hl_trunc_description":"BCP-MAPF – branch-and-cut-and-price for multi-agent path finding","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":235246045,"name":"bcp-mapf","owner_id":12729681,"owner_login":"ed-lam","updated_at":"2023-02-14T04:44:25.919Z","has_issues":true}},"sponsorable":false,"topics":["branch-and-bound","discrete-optimization","combinatorial-optimization","mixed-integer-programming","shortest-path","multi-agent-path-finding","column-generation","branch-and-cut-and-price","branch-price-and-cut"],"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":63,"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%253Aed-lam%252Fbcp-mapf%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/ed-lam/bcp-mapf/star":{"post":"kOL-j8bjuIGe10L4XflxORxrqfOQHLoFL0NHFMKt3SCP7cgoXXipi0s1H9eiAehz0KYMItPJJdH7vD9jUswirA"},"/ed-lam/bcp-mapf/unstar":{"post":"DQ5z6VnacjGoQlat6G8nOF4DgKt8iwr0OCjLu13FdTsMgj0wgNVzcI2v6wRtun4EyzAluyyx5WJZdly1rkDpYQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"GTUg-ghVz8hDyPfx6F6ySvbw9rzyxGwy_F4NfZJJ_M-JYsfT3vJsU45UNEyrjy-NadhYzNCUG9Y5UOk2ycatQg"}}},"title":"Repository search results"}