{"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":"/task/combinatorial-optimization/papers/2","list_of":"/task/combinatorial-optimization","task":"Combinatorial Optimization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":13,"rows_per_page":100,"rows":[101,200],"of":1277,"counts":{"archive_papers_tagged":1277,"with_a_code_link":401,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":1277,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":105,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":105,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/combinatorial-optimization","prev":"/task/combinatorial-optimization","next":"/task/combinatorial-optimization/papers/3","papers":[{"url":"/paper/efficient-parallel-genetic-algorithm-for","slug":"efficient-parallel-genetic-algorithm-for","title":"Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network","date":"2024-12-30","arxiv_id":"2412.20980","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-reinforcement-learning-for-24","slug":"multi-agent-reinforcement-learning-for-24","title":"Multi Agent Reinforcement Learning for Sequential Satellite Assignment Problems","date":"2024-12-20","arxiv_id":"2412.15573","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-agent-reinforcement-learning-for-24#ran","syntology_url":"https://syntology.ai/paper/2412.15573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15573"}},"official":{"repos":["Rainlabuw/rl-enabled-distributed-assignment"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hsevo-elevating-automatic-heuristic-design","slug":"hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","arxiv_id":"2412.14995","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hsevo-elevating-automatic-heuristic-design#ran","syntology_url":"https://syntology.ai/paper/2412.14995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.14995"}},"official":{"repos":["datphamvn/hsevo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/balans-multi-armed-bandits-based-adaptive","slug":"balans-multi-armed-bandits-based-adaptive","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","date":"2024-12-18","arxiv_id":"2412.14382","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-representation-learning-for-mixed","slug":"multi-task-representation-learning-for-mixed","title":"Multi-task Representation Learning for Mixed Integer Linear Programming","date":"2024-12-18","arxiv_id":"2412.14409","repositories_listed":1,"syntology":null},{"url":"/paper/neural-combinatorial-optimization-for","slug":"neural-combinatorial-optimization-for","title":"Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems","date":"2024-12-18","arxiv_id":"2412.14052","repositories_listed":1,"syntology":null},{"url":"/paper/llms-for-cold-start-cutting-plane-separator","slug":"llms-for-cold-start-cutting-plane-separator","title":"LLMs for Cold-Start Cutting Plane Separator Configuration","date":"2024-12-16","arxiv_id":"2412.12038","repositories_listed":1,"syntology":null},{"url":"/paper/districtnet-decision-aware-learning-for","slug":"districtnet-decision-aware-learning-for","title":"DistrictNet: Decision-aware learning for geographical districting","date":"2024-12-11","arxiv_id":"2412.08287","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/districtnet-decision-aware-learning-for#ran","syntology_url":"https://syntology.ai/paper/2412.08287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08287"}},"official":{"repos":["cheikh025/DistrictNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learnable-evolutionary-multi-objective","slug":"learnable-evolutionary-multi-objective","title":"Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model","date":"2024-12-09","arxiv_id":"2412.06140","repositories_listed":1,"syntology":null},{"url":"/paper/approximation-algorithms-for-combinatorial","slug":"approximation-algorithms-for-combinatorial","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","date":"2024-11-25","arxiv_id":"2411.16600","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/approximation-algorithms-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2411.16600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16600"}},"official":{"repos":["adampolak/steiner-tree-with-predictions"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-the-heatmap-monte-carlo-tree","slug":"rethinking-the-heatmap-monte-carlo-tree","title":"Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solvers","date":"2024-11-14","arxiv_id":"2411.09238","repositories_listed":1,"syntology":null},{"url":"/paper/llmopt-learning-to-define-and-solve-general","slug":"llmopt-learning-to-define-and-solve-general","title":"LLMOPT: Learning to Define and Solve General Optimization Problems from Scratch","date":"2024-10-17","arxiv_id":"2410.13213","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llmopt-learning-to-define-and-solve-general#ran","syntology_url":"https://syntology.ai/paper/2410.13213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13213"}},"official":{"repos":["caigaojiang/llmopt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-solver-selection-for-combinatorial","slug":"neural-solver-selection-for-combinatorial","title":"Neural Solver Selection for Combinatorial Optimization","date":"2024-10-13","arxiv_id":"2410.09693","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-solver-selection-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2410.09693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09693"}},"official":{"repos":["lamda-bbo/neural-solver-selection"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-of-the-coefficient","slug":"combinatorial-optimization-of-the-coefficient","title":"Combinatorial optimization of the coefficient of determination","date":"2024-10-12","arxiv_id":"2410.09316","repositories_listed":1,"syntology":null},{"url":"/paper/wardropnet-traffic-flow-predictions-via","slug":"wardropnet-traffic-flow-predictions-via","title":"WardropNet: Traffic Flow Predictions via Equilibrium-Augmented Learning","date":"2024-10-09","arxiv_id":"2410.06656","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-interpretable-control-policies","slug":"synthesizing-interpretable-control-policies","title":"Synthesizing Interpretable Control Policies through Large Language Model Guided Search","date":"2024-10-07","arxiv_id":"2410.05406","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fairness-and-privacy-a-novel-data-pre","slug":"towards-fairness-and-privacy-a-novel-data-pre","title":"Towards Fairness and Privacy: A Novel Data Pre-processing Optimization Framework for Non-binary Protected Attributes","date":"2024-10-01","arxiv_id":"2410.00836","repositories_listed":1,"syntology":null},{"url":"/paper/mg-net-learn-to-customize-qaoa-with-circuit","slug":"mg-net-learn-to-customize-qaoa-with-circuit","title":"MG-Net: Learn to Customize QAOA with Circuit Depth Awareness","date":"2024-09-27","arxiv_id":"2409.18692","repositories_listed":1,"syntology":null},{"url":"/paper/offline-reinforcement-learning-for-learning","slug":"offline-reinforcement-learning-for-learning","title":"Offline Reinforcement Learning for Learning to Dispatch for Job Shop Scheduling","date":"2024-09-16","arxiv_id":"2409.10589","repositories_listed":1,"syntology":null},{"url":"/paper/redundancy-aware-camera-selection-for-indoor","slug":"redundancy-aware-camera-selection-for-indoor","title":"Diversity-Driven View Subset Selection for Indoor Novel View Synthesis","date":"2024-09-11","arxiv_id":"2409.07098","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-by-parallel-quasi-quantum","slug":"optimization-by-parallel-quasi-quantum","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","date":"2024-09-02","arxiv_id":"2409.02135","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/optimization-by-parallel-quasi-quantum#ran","syntology_url":"https://syntology.ai/paper/2409.02135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02135"}},"official":{"repos":["Yuma-Ichikawa/QQA4CO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-great-architecture-for-edge-based-graph","slug":"a-great-architecture-for-edge-based-graph","title":"A GREAT Architecture for Edge-Based Graph Problems Like TSP","date":"2024-08-29","arxiv_id":"2408.16717","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-great-architecture-for-edge-based-graph#ran","syntology_url":"https://syntology.ai/paper/2408.16717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16717"}},"official":{"repos":["attila-lischka/GREAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-unsupervised-learning-framework-combined","slug":"an-unsupervised-learning-framework-combined","title":"An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem","date":"2024-08-16","arxiv_id":"2408.08484","repositories_listed":1,"syntology":null},{"url":"/paper/decision-focused-learning-to-predict-action","slug":"decision-focused-learning-to-predict-action","title":"Decision-Focused Learning to Predict Action Costs for Planning","date":"2024-08-13","arxiv_id":"2408.06876","repositories_listed":1,"syntology":null},{"url":"/paper/2408-03195","slug":"2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","arxiv_id":"2408.03195","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/2408-03195#ran","syntology_url":"https://syntology.ai/paper/2408.03195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03195"}},"official":{"repos":["JasonZhujp/RELIEF"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-02207","slug":"2408-02207","title":"MARCO: A Memory-Augmented Reinforcement Framework for Combinatorial Optimization","date":"2024-08-05","arxiv_id":"2408.02207","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2408-02207#ran","syntology_url":"https://syntology.ai/paper/2408.02207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.02207"}},"official":{"repos":["TheLeprechaun25/MARCO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/take-a-step-and-reconsider-sequence-decoding","slug":"take-a-step-and-reconsider-sequence-decoding","title":"Take a Step and Reconsider: Sequence Decoding for Self-Improved Neural Combinatorial Optimization","date":"2024-07-24","arxiv_id":"2407.17206","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-the-stability-number-of-a-random","slug":"estimating-the-stability-number-of-a-random","title":"Estimating the stability number of a random graph using convolutional neural networks","date":"2024-07-10","arxiv_id":"2407.07827","repositories_listed":1,"syntology":null},{"url":"/paper/prance-joint-token-optimization-and","slug":"prance-joint-token-optimization-and","title":"PRANCE: Joint Token-Optimization and Structural Channel-Pruning for Adaptive ViT Inference","date":"2024-07-06","arxiv_id":"2407.05010","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-reinforcement-learning-based","slug":"a-two-stage-reinforcement-learning-based","title":"A Two-stage Reinforcement Learning-based Approach for Multi-entity Task Allocation","date":"2024-06-29","arxiv_id":"2407.00496","repositories_listed":1,"syntology":null},{"url":"/paper/dataless-quadratic-neural-networks-for-the","slug":"dataless-quadratic-neural-networks-for-the","title":"Differentiable Quadratic Optimization For The Maximum Independent Set Problem","date":"2024-06-27","arxiv_id":"2406.19532","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-remove-cuts-in-integer-linear","slug":"learning-to-remove-cuts-in-integer-linear","title":"Learning to Remove Cuts in Integer Linear Programming","date":"2024-06-26","arxiv_id":"2406.18781","repositories_listed":1,"syntology":null},{"url":"/paper/memory-enhanced-neural-solvers-for-efficient","slug":"memory-enhanced-neural-solvers-for-efficient","title":"Memory-Enhanced Neural Solvers for Efficient Adaptation in Combinatorial Optimization","date":"2024-06-24","arxiv_id":"2406.16424","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/memory-enhanced-neural-solvers-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.16424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16424"}},"official":{"repos":["instadeepai/memento"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-a-generalist-combinatorial-optimization","slug":"goal-a-generalist-combinatorial-optimization","title":"GOAL: A Generalist Combinatorial Optimization Agent Learning","date":"2024-06-21","arxiv_id":"2406.15079","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/goal-a-generalist-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.15079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15079"}},"official":{"repos":["naver/goal-co"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/training-greedy-policy-for-proposal-batch","slug":"training-greedy-policy-for-proposal-batch","title":"Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization","date":"2024-06-21","arxiv_id":"2406.14876","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/training-greedy-policy-for-proposal-batch#ran","syntology_url":"https://syntology.ai/paper/2406.14876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14876"}},"official":{"repos":["snu-mllab/greedypolicyformoco"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-benchmark-study-of-deep-rl-methods-for","slug":"a-benchmark-study-of-deep-rl-methods-for","title":"A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs","date":"2024-06-20","arxiv_id":"2406.14697","repositories_listed":1,"syntology":null},{"url":"/paper/coupled-input-output-dimension-reduction","slug":"coupled-input-output-dimension-reduction","title":"Coupled Input-Output Dimension Reduction: Application to Goal-oriented Bayesian Experimental Design and Global Sensitivity Analysis","date":"2024-06-19","arxiv_id":"2406.13425","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmark-for-maximum-cut-towards","slug":"a-benchmark-for-maximum-cut-towards","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","date":"2024-06-14","arxiv_id":"2406.11897","repositories_listed":1,"syntology":null},{"url":"/paper/deep-symbolic-optimization-for-combinatorial","slug":"deep-symbolic-optimization-for-combinatorial","title":"Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics","date":"2024-06-14","arxiv_id":"2406.09740","repositories_listed":1,"syntology":null},{"url":"/paper/learning-solution-aware-transformers-for","slug":"learning-solution-aware-transformers-for","title":"Learning Solution-Aware Transformers for Efficiently Solving Quadratic Assignment Problem","date":"2024-06-14","arxiv_id":"2406.09899","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-solution-aware-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2406.09899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09899"}},"official":{"repos":["pkutan/sawt"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/injecting-combinatorial-optimization-into","slug":"injecting-combinatorial-optimization-into","title":"Injecting Combinatorial Optimization into MCTS: Application to the Board Game boop","date":"2024-06-13","arxiv_id":"2406.08766","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-model-assisted-adversarial","slug":"large-language-model-assisted-adversarial","title":"Large Language Model Assisted Adversarial Robustness Neural Architecture Search","date":"2024-06-08","arxiv_id":"2406.05433","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-optimization-with-automated","slug":"combinatorial-optimization-with-automated","title":"Combinatorial Optimization with Automated Graph Neural Networks","date":"2024-06-05","arxiv_id":"2406.02872","repositories_listed":1,"syntology":null},{"url":"/paper/a-diffusion-model-framework-for-unsupervised","slug":"a-diffusion-model-framework-for-unsupervised","title":"A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization","date":"2024-06-03","arxiv_id":"2406.01661","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-diffusion-model-framework-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2406.01661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01661"}},"official":{"repos":["ml-jku/diffuco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-algorithms","slug":"neural-combinatorial-optimization-algorithms","title":"Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives","date":"2024-06-01","arxiv_id":"2406.00415","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-general-gnn-framework-for","slug":"towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","arxiv_id":"2405.20543","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-a-general-gnn-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.20543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20543"}},"official":{"repos":["wenkelf/copt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-random-key-grasp-for-combinatorial","slug":"a-random-key-grasp-for-combinatorial","title":"A random-key GRASP for combinatorial optimization","date":"2024-05-29","arxiv_id":"2405.18681","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-of-functions-over-node","slug":"bayesian-optimization-of-functions-over-node","title":"Bayesian Optimization of Functions over Node Subsets in Graphs","date":"2024-05-24","arxiv_id":"2405.15119","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bayesian-optimization-of-functions-over-node#ran","syntology_url":"https://syntology.ai/paper/2405.15119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15119"}},"official":{"repos":["LeonResearch/GraphComBO"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/prodag-projection-induced-variational","slug":"prodag-projection-induced-variational","title":"ProDAG: Projected Variational Inference for Directed Acyclic Graphs","date":"2024-05-24","arxiv_id":"2405.15167","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-learning-for-generalized-vehicle","slug":"prompt-learning-for-generalized-vehicle","title":"Prompt Learning for Generalized Vehicle Routing","date":"2024-05-20","arxiv_id":"2405.12262","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/prompt-learning-for-generalized-vehicle#ran","syntology_url":"https://syntology.ai/paper/2405.12262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12262"}},"official":{"repos":["feiliu36/promptvrp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/large-neighborhood-prioritized-search-for","slug":"large-neighborhood-prioritized-search-for","title":"Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming","date":"2024-05-18","arxiv_id":"2405.11305","repositories_listed":1,"syntology":null},{"url":"/paper/cons-training-tensor-networks","slug":"cons-training-tensor-networks","title":"Cons-training Tensor Networks: Embedding and Optimization Over Discrete Linear Constraints","date":"2024-05-15","arxiv_id":"2405.09005","repositories_listed":1,"syntology":null},{"url":"/paper/partial-information-decomposition-as","slug":"partial-information-decomposition-as","title":"Partial information decomposition: redundancy as information bottleneck","date":"2024-05-13","arxiv_id":"2405.07665","repositories_listed":1,"syntology":null},{"url":"/paper/floorset-a-vlsi-floorplanning-dataset-with","slug":"floorset-a-vlsi-floorplanning-dataset-with","title":"FloorSet -- a VLSI Floorplanning Dataset with Design Constraints of Real-World SoCs","date":"2024-05-09","arxiv_id":"2405.05480","repositories_listed":1,"syntology":null},{"url":"/paper/test-time-augmentation-for-traveling","slug":"test-time-augmentation-for-traveling","title":"Test-Time Augmentation for Traveling Salesperson Problem","date":"2024-05-08","arxiv_id":"2405.04767","repositories_listed":1,"syntology":null},{"url":"/paper/instance-conditioned-adaptation-for-large","slug":"instance-conditioned-adaptation-for-large","title":"Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver","date":"2024-05-03","arxiv_id":"2405.01906","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/instance-conditioned-adaptation-for-large#ran","syntology_url":"https://syntology.ai/paper/2405.01906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01906"}},"official":{"repos":["ciam-group/icam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mining-potentially-explanatory-patterns-via","slug":"mining-potentially-explanatory-patterns-via","title":"Mining Potentially Explanatory Patterns via Partial Solutions","date":"2024-04-05","arxiv_id":"2404.04388","repositories_listed":1,"syntology":null},{"url":"/paper/self-improvement-for-neural-combinatorial","slug":"self-improvement-for-neural-combinatorial","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","date":"2024-03-22","arxiv_id":"2403.15180","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-improvement-for-neural-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2403.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15180"}},"official":{"repos":["grimmlab/gumbeldore"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-robot-connected-fermat-spiral-coverage","slug":"multi-robot-connected-fermat-spiral-coverage","title":"Multi-Robot Connected Fermat Spiral Coverage","date":"2024-03-20","arxiv_id":"2403.13311","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-combinatorial-optimization-via-heat","slug":"efficient-combinatorial-optimization-via-heat","title":"Efficient Combinatorial Optimization via Heat Diffusion","date":"2024-03-13","arxiv_id":"2403.08757","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-combinatorial-optimization-via-heat#ran","syntology_url":"https://syntology.ai/paper/2403.08757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.08757"}},"official":{"repos":["awakermhy/heo"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/acceleratedlingam-learning-causal-dags-at-the","slug":"acceleratedlingam-learning-causal-dags-at-the","title":"AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUs","date":"2024-03-06","arxiv_id":"2403.03772","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/acceleratedlingam-learning-causal-dags-at-the#ran","syntology_url":"https://syntology.ai/paper/2403.03772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03772"}},"official":{"repos":["viktour19/culingam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/routeexplainer-an-explanation-framework-for","slug":"routeexplainer-an-explanation-framework-for","title":"RouteExplainer: An Explanation Framework for Vehicle Routing Problem","date":"2024-03-06","arxiv_id":"2403.03585","repositories_listed":1,"syntology":null},{"url":"/paper/where-the-really-hard-quadratic-assignment","slug":"where-the-really-hard-quadratic-assignment","title":"Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances","date":"2024-03-05","arxiv_id":"2403.02783","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-job-shop-scheduling-under","slug":"learning-to-solve-job-shop-scheduling-under","title":"Learning to Solve Job Shop Scheduling under Uncertainty","date":"2024-03-04","arxiv_id":"2404.01308","repositories_listed":1,"syntology":null},{"url":"/paper/mmsr-symbolic-regression-is-a-multimodal-task","slug":"mmsr-symbolic-regression-is-a-multimodal-task","title":"MMSR: Symbolic Regression is a Multi-Modal Information Fusion Task","date":"2024-02-28","arxiv_id":"2402.18603","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-learning-for-routing-problem-with","slug":"multi-task-learning-for-routing-problem-with","title":"Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization","date":"2024-02-23","arxiv_id":"2402.16891","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-learning-for-routing-problem-with#ran","syntology_url":"https://syntology.ai/paper/2402.16891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16891"}},"official":{"repos":["feiliu36/mtnco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/risk-sensitive-soft-actor-critic-for-robust","slug":"risk-sensitive-soft-actor-critic-for-robust","title":"Risk-Sensitive Soft Actor-Critic for Robust Deep Reinforcement Learning under Distribution Shifts","date":"2024-02-15","arxiv_id":"2402.09992","repositories_listed":1,"syntology":null},{"url":"/paper/moco-a-learnable-meta-optimizer-for","slug":"moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","arxiv_id":"2402.04915","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moco-a-learnable-meta-optimizer-for#ran","syntology_url":"https://syntology.ai/paper/2402.04915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04915"}},"official":{"repos":["timd3/moco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simulation-based-bayesian-optimization","slug":"simulation-based-bayesian-optimization","title":"Simulation Based Bayesian Optimization","date":"2024-01-19","arxiv_id":"2401.10811","repositories_listed":1,"syntology":null},{"url":"/paper/osmlocator-locating-overlapping-scatter-marks","slug":"osmlocator-locating-overlapping-scatter-marks","title":"OsmLocator: locating overlapping scatter marks with a non-training generative perspective","date":"2023-12-18","arxiv_id":"2312.11146","repositories_listed":1,"syntology":null},{"url":"/paper/combhelper-a-neural-approach-to-reduce-search","slug":"combhelper-a-neural-approach-to-reduce-search","title":"COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems","date":"2023-12-14","arxiv_id":"2312.09086","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-team-orienteering-problem-with-1","slug":"solving-the-team-orienteering-problem-with-1","title":"TOP-Former: A Multi-Agent Transformer Approach for the Team Orienteering Problem","date":"2023-11-30","arxiv_id":"2311.18662","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-and-analysis-of-evolutionary","slug":"a-survey-and-analysis-of-evolutionary","title":"A Survey and Analysis of Evolutionary Operators for Permutations","date":"2023-11-24","arxiv_id":"2311.14595","repositories_listed":1,"syntology":null},{"url":"/paper/variational-annealing-on-graphs-for","slug":"variational-annealing-on-graphs-for","title":"Variational Annealing on Graphs for Combinatorial Optimization","date":"2023-11-23","arxiv_id":"2311.14156","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":16,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/variational-annealing-on-graphs-for#ran","syntology_url":"https://syntology.ai/paper/2311.14156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14156"}},"official":{"repos":["ml-jku/vag-co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/all-to-all-reconfigurability-with-sparse","slug":"all-to-all-reconfigurability-with-sparse","title":"All-to-all reconfigurability with sparse and higher-order Ising machines","date":"2023-11-21","arxiv_id":"2312.08748","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-optimization-with-policy","slug":"combinatorial-optimization-with-policy","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","date":"2023-11-13","arxiv_id":"2311.13569","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-with-policy#ran","syntology_url":"https://syntology.ai/paper/2311.13569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13569"}},"official":{"repos":["instadeepai/compass"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-and-benchmarking-predict-then","slug":"rethinking-and-benchmarking-predict-then","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","date":"2023-11-13","arxiv_id":"2311.07633","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-benchmarking-predict-then#ran","syntology_url":"https://syntology.ai/paper/2311.07633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07633"}},"official":{"repos":["thinklab-sjtu/predictiveco-benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-sequencing-of-documents","slug":"temporal-sequencing-of-documents","title":"Temporal Sequencing of Documents","date":"2023-11-05","arxiv_id":"2311.02578","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-as-evolutionary","slug":"large-language-models-as-evolutionary","title":"Large Language Models as Evolutionary Optimizers","date":"2023-10-29","arxiv_id":"2310.19046","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/large-language-models-as-evolutionary#ran","syntology_url":"https://syntology.ai/paper/2310.19046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19046"}},"official":{"repos":["cschen1205/lmea"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/interferometric-neural-networks","slug":"interferometric-neural-networks","title":"Interferometric Neural Networks","date":"2023-10-25","arxiv_id":"2310.16742","repositories_listed":1,"syntology":null},{"url":"/paper/neural-multi-objective-combinatorial","slug":"neural-multi-objective-combinatorial","title":"Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement","date":"2023-10-22","arxiv_id":"2310.15195","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-multi-objective-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2310.15195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15195"}},"official":{"repos":["bill-cjb/nhde"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/survival-of-the-most-influential-prompts","slug":"survival-of-the-most-influential-prompts","title":"Survival of the Most Influential Prompts: Efficient Black-Box Prompt Search via Clustering and Pruning","date":"2023-10-19","arxiv_id":"2310.12774","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/survival-of-the-most-influential-prompts#ran","syntology_url":"https://syntology.ai/paper/2310.12774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12774"}},"official":{"repos":["cambridgeltl/claps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-power-of-graph-neural-networks","slug":"exploring-the-power-of-graph-neural-networks","title":"Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems","date":"2023-10-16","arxiv_id":"2310.10603","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-the-power-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.10603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10603"}},"official":{"repos":["chendiqian/IPM_MPNN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-scp-accelerating-set-cover-problems","slug":"graph-scp-accelerating-set-cover-problems","title":"Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks","date":"2023-10-12","arxiv_id":"2310.07979","repositories_listed":1,"syntology":null},{"url":"/paper/neural-combinatorial-optimization-with-heavy","slug":"neural-combinatorial-optimization-with-heavy","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","date":"2023-10-12","arxiv_id":"2310.07985","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-combinatorial-optimization-with-heavy#ran","syntology_url":"https://syntology.ai/paper/2310.07985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07985"}},"official":{"repos":["ciam-group/nco_code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-instance-generative-framework-for-milp-1","slug":"a-deep-instance-generative-framework-for-milp-1","title":"A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability","date":"2023-10-04","arxiv_id":"2310.02807","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-deep-instance-generative-framework-for-milp-1#ran","syntology_url":"https://syntology.ai/paper/2310.02807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02807"}},"official":{"repos":["miralab-ustc/l2o-g2milp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/are-graph-neural-networks-optimal","slug":"are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","arxiv_id":"2310.00526","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":13,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/are-graph-neural-networks-optimal#ran","syntology_url":"https://syntology.ai/paper/2310.00526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00526"}},"official":{"repos":["penlu/bespoke-gnn4do"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/controlling-continuous-relaxation-for","slug":"controlling-continuous-relaxation-for","title":"Controlling Continuous Relaxation for Combinatorial Optimization","date":"2023-09-29","arxiv_id":"2309.16965","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/controlling-continuous-relaxation-for#ran","syntology_url":"https://syntology.ai/paper/2309.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16965"}},"official":{"repos":["Yuma-Ichikawa/CRA4CO"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/too-big-so-fail-enabling-neural-construction","slug":"too-big-so-fail-enabling-neural-construction","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","date":"2023-09-29","arxiv_id":"2309.17089","repositories_listed":1,"syntology":null},{"url":"/paper/deepaco-neural-enhanced-ant-systems-for","slug":"deepaco-neural-enhanced-ant-systems-for","title":"DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization","date":"2023-09-25","arxiv_id":"2309.14032","repositories_listed":1,"syntology":null},{"url":"/paper/qal-bp-an-augmented-lagrangian-quantum","slug":"qal-bp-an-augmented-lagrangian-quantum","title":"QAL-BP: An Augmented Lagrangian Quantum Approach for Bin Packing","date":"2023-09-22","arxiv_id":"2309.12678","repositories_listed":1,"syntology":null},{"url":"/paper/implementation-of-digital-memcomputing-using","slug":"implementation-of-digital-memcomputing-using","title":"Implementation of digital MemComputing using standard electronic components","date":"2023-09-21","arxiv_id":"2309.12437","repositories_listed":1,"syntology":null},{"url":"/paper/let-the-flows-tell-solving-graph-1","slug":"let-the-flows-tell-solving-graph-1","title":"Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets","date":"2023-09-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/let-the-flows-tell-solving-graph-2","slug":"let-the-flows-tell-solving-graph-2","title":"Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets","date":"2023-09-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sub-universal-variational-circuits-for","slug":"sub-universal-variational-circuits-for","title":"Sub-universal variational circuits for combinatorial optimization problems","date":"2023-08-29","arxiv_id":"2308.14981","repositories_listed":1,"syntology":null},{"url":"/paper/towards-generalizable-neural-solvers-for","slug":"towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","arxiv_id":"2308.14104","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-generalizable-neural-solvers-for#ran","syntology_url":"https://syntology.ai/paper/2308.14104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14104"}},"official":{"repos":["gaocrr/elg"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/job-shop-scheduling-via-deep-reinforcement","slug":"job-shop-scheduling-via-deep-reinforcement","title":"Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach","date":"2023-08-03","arxiv_id":"2308.01797","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-non","slug":"reinforcement-learning-based-non","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","date":"2023-08-01","arxiv_id":"2308.00560","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-based-non#ran","syntology_url":"https://syntology.ai/paper/2308.00560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.00560"}},"official":{"repos":["xybfight/nar4tsp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joingym-an-efficient-query-optimization","slug":"joingym-an-efficient-query-optimization","title":"JoinGym: An Efficient Query Optimization Environment for Reinforcement Learning","date":"2023-07-21","arxiv_id":"2307.11704","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-task-offloading-optimization-framework","slug":"a-fast-task-offloading-optimization-framework","title":"A Fast Task Offloading Optimization Framework for IRS-Assisted Multi-Access Edge Computing System","date":"2023-07-17","arxiv_id":"2307.08474","repositories_listed":1,"syntology":null}],"record_sha256":"13e5797d73a82f1768638e317afc80793528ce8989c7ac067d1d2b5e1bad0269","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}