{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/cvrpmodel","entry":"CVRPModel","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2306.02688","paper":"/paper/meta-sage-scale-meta-learning-scheduled","title":"Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/meta-sage","path":"Meta-SAGE/train/POMO/CVRP/2_Meta/SML_Model.py","file_url":"https://github.com/kaist-silab/meta-sage/blob/HEAD/Meta-SAGE/train/POMO/CVRP/2_Meta/SML_Model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d4d4b5a5c19abb2f","mcp_get_code":{"code_sha256":"d4d4b5a5c19abb2f"}},{"arxiv_id":"2207.06190","paper":"/paper/simulation-guided-beam-search-for-neural","title":"Simulation-guided Beam Search for Neural Combinatorial Optimization","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yd-kwon/sgbs","path":"CVRP/2_SGBS/CVRPModel.py","file_url":"https://github.com/yd-kwon/sgbs/blob/HEAD/CVRP/2_SGBS/CVRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f53dbf4d4654d32","mcp_get_code":{"code_sha256":"8f53dbf4d4654d32"}},{"arxiv_id":"2205.13209","paper":"/paper/sym-nco-leveraging-symmetricity-for-neural","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alstn12088/sym-nco","path":"Sym-NCO-POMO/CVRP/CVRPModel_ours.py","file_url":"https://github.com/alstn12088/sym-nco/blob/HEAD/Sym-NCO-POMO/CVRP/CVRPModel_ours.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d0b0edc8aec44b45","mcp_get_code":{"code_sha256":"d0b0edc8aec44b45"}},{"arxiv_id":"2203.15386","paper":"/paper/pareto-set-learning-for-neural-multi","title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xi-l/pmoco","path":"MOCVRP/POMO/MOCVRPModel.py","file_url":"https://github.com/xi-l/pmoco/blob/HEAD/MOCVRP/POMO/MOCVRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4fe8b662378920b0","mcp_get_code":{"code_sha256":"4fe8b662378920b0"}},{"arxiv_id":"2010.16011","paper":"/paper/pomo-policy-optimization-with-multiple-optima","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/symmetric_replay","path":"euclidean_co/pomo/CVRP/POMO/CVRPModel.py","file_url":"https://github.com/kaist-silab/symmetric_replay/blob/HEAD/euclidean_co/pomo/CVRP/POMO/CVRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"25808ce4b5d5bf84","mcp_get_code":{"code_sha256":"25808ce4b5d5bf84"}}]}