{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/exact-combinatorial-optimization-with-graph","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","arxiv_id":"1906.01629","date":"2019-06-04","proceeding":"NeurIPS 2019 12","authors":["Maxime Gasse","Didier Chételat","Nicola Ferroni","Laurent Charlin","Andrea Lodi"],"abstract":"Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural variable-constraint bipartite graph representation of mixed-integer linear programs. We train our model via imitation learning from the strong branching expert rule, and demonstrate on a series of hard problems that our approach produces policies that improve upon state-of-the-art machine-learning methods for branching and generalize to instances significantly larger than seen during training. Moreover, we improve for the first time over expert-designed branching rules implemented in a state-of-the-art solver on large problems. Code for reproducing all the experiments can be found at https://github.com/ds4dm/learn2branch.","url_abs":"https://arxiv.org/abs/1906.01629v3","url_pdf":"https://arxiv.org/pdf/1906.01629v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/ds4dm/learn2branch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/audreyanneguindon/NeurIPS_2019","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/ds4dm/branch-search-trees","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/isotlaboratory/ml4vrp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/sclbd/accelerated-lpbox-admm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"exact-combinatorial-optimization-with-graph","repo_url":"https://github.com/whuang-io/Distributional_MIPLIB_eval","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"variable-selection","task_name":"Variable Selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1906.01629","atlas_url":"https://app.syntology.ai/?focus=1906.01629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01629"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.01629"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.01629"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.01629\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1906.01629"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1906.01629\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1906.01629"},"call":"get_concepts_for_paper(arxiv_id=\"1906.01629\")"}],"by_repo":[{"repo":"ds4dm/learn2branch","kind":"official","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"audreyanneguindon/NeurIPS_2019","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"ds4dm/branch-search-trees","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2002.05120"],"harvested_for_calls":[{"arxiv_id":"2002.05120","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.05120"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.05120\")"}]},{"repo":"isotlaboratory/ml4vrp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1706.02216","1710.10903"],"harvested_for_calls":[{"arxiv_id":"1706.02216","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.02216"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.02216\")"},{"arxiv_id":"1710.10903","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.10903"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.10903\")"}]},{"repo":"sclbd/accelerated-lpbox-admm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"whuang-io/Distributional_MIPLIB_eval","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1906.01629.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1906.01629.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ds4dm/learn2branch","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sclbd/accelerated-lpbox-admm","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ds4dm/branch-search-trees","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/whuang-io/Distributional_MIPLIB_eval","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/audreyanneguindon/NeurIPS_2019","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/isotlaboratory/ml4vrp","reach":null}],"summary":{"unverified":2},"n_samples":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"listed":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"samples":[{"code_sha256":"f013973407932b8b","code_sha256_prefix":"f013973407932b8b","entry":"generate_cauctions","repo":"ds4dm/learn2branch","repo_kind":"official","path":"01_generate_instances.py","file_url":"https://github.com/ds4dm/learn2branch/blob/HEAD/01_generate_instances.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f013973407932b8b"}},{"code_sha256":"79386a0cdecc0742","code_sha256_prefix":"79386a0cdecc0742","entry":"generate_cauctions","repo":"audreyanneguindon/NeurIPS_2019","repo_kind":"listed","path":"01_generate_instances.py","file_url":"https://github.com/audreyanneguindon/NeurIPS_2019/blob/HEAD/01_generate_instances.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, audreyanneguindon/NeurIPS_2019 when it was checked","mcp_get_code":{"code_sha256":"79386a0cdecc0742"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"70c5959da337bce2098b1319c8c7e7b7d2d648dedbf1162636360cf93a358f3a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}