{"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/learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","arxiv_id":"1704.01665","date":"2017-04-05","proceeding":"NeurIPS 2017 12","authors":["Hanjun Dai","Elias B. Khalil","Yuyu Zhang","Bistra Dilkina","Le Song"],"abstract":"The design of good heuristics or approximation algorithms for NP-hard\ncombinatorial optimization problems often requires significant specialized\nknowledge and trial-and-error. Can we automate this challenging, tedious\nprocess, and learn the algorithms instead? In many real-world applications, it\nis typically the case that the same optimization problem is solved again and\nagain on a regular basis, maintaining the same problem structure but differing\nin the data. This provides an opportunity for learning heuristic algorithms\nthat exploit the structure of such recurring problems. In this paper, we\npropose a unique combination of reinforcement learning and graph embedding to\naddress this challenge. The learned greedy policy behaves like a meta-algorithm\nthat incrementally constructs a solution, and the action is determined by the\noutput of a graph embedding network capturing the current state of the\nsolution. We show that our framework can be applied to a diverse range of\noptimization problems over graphs, and learns effective algorithms for the\nMinimum Vertex Cover, Maximum Cut and Traveling Salesman problems.","url_abs":"http://arxiv.org/abs/1704.01665v4","url_pdf":"http://arxiv.org/pdf/1704.01665v4.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":"learning-combinatorial-optimization","repo_url":"https://github.com/Hanjun-Dai/graph_comb_opt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/DavidLee-4032/Graph_Opt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/LoganZhao1997/last_mile_challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/Loriba4/Lori-Baxter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/ilBarbara/BioRL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/louisv123/COLGE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/sadhikamalladi/RL-Coloring","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-combinatorial-optimization","repo_url":"https://github.com/tomdbar/eco-dqn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.01665","atlas_url":"https://app.syntology.ai/?focus=1704.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01665"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.01665"},"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":"1704.01665"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.01665\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1704.01665"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.01665\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.01665"},"call":"get_concepts_for_paper(arxiv_id=\"1704.01665\")"}],"by_repo":[{"repo":"Hanjun-Dai/graph_comb_opt","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"DavidLee-4032/Graph_Opt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LoganZhao1997/last_mile_challenge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Loriba4/Lori-Baxter","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ilBarbara/BioRL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.04063"],"harvested_for_calls":[{"arxiv_id":"1909.04063","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.04063"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.04063\")"}]},{"repo":"louisv123/COLGE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sadhikamalladi/RL-Coloring","kind":"listed","samples":2,"ran":2,"instrument":1,"unverified":0},{"repo":"tomdbar/eco-dqn","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/1704.01665.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/1704.01665.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/ilBarbara/BioRL","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DavidLee-4032/Graph_Opt","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/louisv123/COLGE","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/LoganZhao1997/last_mile_challenge","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tomdbar/eco-dqn","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Hanjun-Dai/graph_comb_opt","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Loriba4/Lori-Baxter","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sadhikamalladi/RL-Coloring","reach":null}],"summary":{"ran_violates":1,"ran_draft_wrong":1},"n_samples":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"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":{"listed":{"samples":2,"ran":2,"n_ran_checked":1,"n_instrument":1,"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"},"official_not_harvested":{"repositories":["Hanjun-Dai/graph_comb_opt"],"harvested_for_other_papers":[0],"samples_from_other_repositories":2,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":2,"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,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"809450cf9580db6b","code_sha256_prefix":"809450cf9580db6b","entry":"iter_or_loopcall","repo":"sadhikamalladi/RL-Coloring","repo_kind":"listed","path":"runner.py","file_url":"https://github.com/sadhikamalladi/RL-Coloring/blob/HEAD/runner.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"o:callable/0/?, count:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","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, sadhikamalladi/RL-Coloring when it was checked","mcp_get_code":{"code_sha256":"809450cf9580db6b"}},{"code_sha256":"9dceb7338c91e2ea","code_sha256_prefix":"9dceb7338c91e2ea","entry":"listify","repo":"sadhikamalladi/RL-Coloring","repo_kind":"listed","path":"runner.py","file_url":"https://github.com/sadhikamalladi/RL-Coloring/blob/HEAD/runner.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"o:str/0/str, count:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"9dceb7338c91e2ea"},"code_page":"/code/listify","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sadhikamalladi/RL-Coloring when it was checked","mcp_get_code":{"code_sha256":"9dceb7338c91e2ea"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e7f3509b7dc657950500de7801b0efe32ddbe3137bdf274d468bc8d9fa42accd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}