{"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/4","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":4,"pages_in_order":13,"rows_per_page":100,"rows":[301,400],"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/papers/3","next":"/task/combinatorial-optimization/papers/5","papers":[{"url":"/paper/fastcover-an-unsupervised-learning-framework","slug":"fastcover-an-unsupervised-learning-framework","title":"FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social Networks","date":"2021-10-31","arxiv_id":"2111.00463","repositories_listed":1,"syntology":null},{"url":"/paper/openabc-d-a-large-scale-dataset-for-machine","slug":"openabc-d-a-large-scale-dataset-for-machine","title":"OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis","date":"2021-10-21","arxiv_id":"2110.11292","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":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) · 3 unverified","sample_list":"/paper/openabc-d-a-large-scale-dataset-for-machine#ran","syntology_url":"https://syntology.ai/paper/2110.11292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11292"}},"official":{"repos":["nyu-mlda/openabc"],"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/rl4rs-a-real-world-benchmark-for","slug":"rl4rs-a-real-world-benchmark-for","title":"RL4RS: A Real-World Dataset for Reinforcement Learning based Recommender System","date":"2021-10-18","arxiv_id":"2110.11073","repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-solve-the-max-cut-problem-via-a","slug":"efficiently-solve-the-max-cut-problem-via-a","title":"Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation Algorithm","date":"2021-10-15","arxiv_id":"2110.08016","repositories_listed":1,"syntology":null},{"url":"/paper/solving-large-break-minimization-problems-in","slug":"solving-large-break-minimization-problems-in","title":"Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing","date":"2021-10-14","arxiv_id":"2110.07239","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-pointer-networks-for-traveling","slug":"hybrid-pointer-networks-for-traveling","title":"Hybrid Pointer Networks for Traveling Salesman Problems Optimization","date":"2021-10-06","arxiv_id":"2110.03104","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-markov-decision-process-in-the","slug":"learning-the-markov-decision-process-in-the","title":"Learning the Markov Decision Process in the Sparse Gaussian Elimination","date":"2021-09-30","arxiv_id":"2109.14929","repositories_listed":1,"syntology":null},{"url":"/paper/rama-a-rapid-multicut-algorithm-on-gpu","slug":"rama-a-rapid-multicut-algorithm-on-gpu","title":"RAMA: A Rapid Multicut Algorithm on GPU","date":"2021-09-04","arxiv_id":"2109.01838","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-chromatic-and-clique-numbers-of","slug":"deep-learning-chromatic-and-clique-numbers-of","title":"Deep Learning Chromatic and Clique Numbers of Graphs","date":"2021-08-04","arxiv_id":"2108.01810","repositories_listed":1,"syntology":null},{"url":"/paper/formulating-neural-sentence-ordering-as-the","slug":"formulating-neural-sentence-ordering-as-the","title":"Formulating Neural Sentence Ordering as the Asymmetric Traveling Salesman Problem","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-large-neighborhood-search","slug":"learning-a-large-neighborhood-search","title":"Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs","date":"2021-07-21","arxiv_id":"2107.10201","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":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) · 0 unverified","sample_list":"/paper/learning-a-large-neighborhood-search#ran","syntology_url":"https://syntology.ai/paper/2107.10201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10201"}},"official":{"repos":["deepmind/neural_lns"],"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/usco-solver-solving-undetermined-stochastic","slug":"usco-solver-solving-undetermined-stochastic","title":"USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems","date":"2021-07-15","arxiv_id":"2107.07508","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/usco-solver-solving-undetermined-stochastic#ran","syntology_url":"https://syntology.ai/paper/2107.07508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07508"}},"official":null}},{"url":"/paper/learning-delaunay-triangulation-using-self","slug":"learning-delaunay-triangulation-using-self","title":"Learning Geometric Combinatorial Optimization Problems using Self-attention and Domain Knowledge","date":"2021-07-05","arxiv_id":"2107.01759","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 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) · 0 unverified","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}},"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-primal-heuristics-for-mixed-integer","slug":"learning-primal-heuristics-for-mixed-integer","title":"Learning Primal Heuristics for Mixed Integer Programs","date":"2021-07-02","arxiv_id":"2107.00866","repositories_listed":1,"syntology":null},{"url":"/paper/recurrently-predicting-hypergraphs","slug":"recurrently-predicting-hypergraphs","title":"Pruning Edges and Gradients to Learn Hypergraphs from Larger Sets","date":"2021-06-26","arxiv_id":"2106.13919","repositories_listed":1,"syntology":null},{"url":"/paper/binarizedattack-structural-poisoning-attacks","slug":"binarizedattack-structural-poisoning-attacks","title":"BinarizedAttack: Structural Poisoning Attacks to Graph-based Anomaly Detection","date":"2021-06-18","arxiv_id":"2106.09989","repositories_listed":1,"syntology":null},{"url":"/paper/contingency-aware-influence-maximization-a","slug":"contingency-aware-influence-maximization-a","title":"Contingency-Aware Influence Maximization: A Reinforcement Learning Approach","date":"2021-06-13","arxiv_id":"2106.07039","repositories_listed":1,"syntology":null},{"url":"/paper/solving-graph-based-public-good-games-with","slug":"solving-graph-based-public-good-games-with","title":"Solving Graph-based Public Good Games with Tree Search and Imitation Learning","date":"2021-06-12","arxiv_id":"2106.06762","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/solving-graph-based-public-good-games-with#ran","syntology_url":"https://syntology.ai/paper/2106.06762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06762"}},"official":{"repos":["victordarvariu/solving-graph-pgg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-bi-level-framework-for-learning-to-solve","slug":"a-bi-level-framework-for-learning-to-solve","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","date":"2021-06-09","arxiv_id":"2106.04927","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":2,"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-bi-level-framework-for-learning-to-solve#ran","syntology_url":"https://syntology.ai/paper/2106.04927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04927"}},"official":{"repos":["thinklab-sjtu/ppo-bihyb"],"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/nisq-algorithm-for-semidefinite-programming","slug":"nisq-algorithm-for-semidefinite-programming","title":"Noisy intermediate-scale quantum algorithm for semidefinite programming","date":"2021-06-07","arxiv_id":"2106.03891","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-rubik-s-cube-solver","slug":"self-supervised-rubik-s-cube-solver","title":"Self-Supervision is All You Need for Solving Rubik's Cube","date":"2021-06-06","arxiv_id":"2106.03157","repositories_listed":1,"syntology":null},{"url":"/paper/intriguing-parameters-of-structural-causal","slug":"intriguing-parameters-of-structural-causal","title":"Structural Causal Models Reveal Confounder Bias in Linear Program Modelling","date":"2021-05-26","arxiv_id":"2105.12697","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-based-deep-reinforcement","slug":"meta-learning-based-deep-reinforcement","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","date":"2021-05-06","arxiv_id":"2105.02741","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/meta-learning-based-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2105.02741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02741"}},"official":{"repos":["zhangzizhen/ml-dam"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/solve-routing-problems-with-a-residual-edge","slug":"solve-routing-problems-with-a-residual-edge","title":"Solve routing problems with a residual edge-graph attention neural network","date":"2021-05-06","arxiv_id":"2105.02730","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-surrogate-assisted-evolutionary","slug":"a-novel-surrogate-assisted-evolutionary","title":"A Novel Surrogate-assisted Evolutionary Algorithm Applied to Partition-based Ensemble Learning","date":"2021-04-16","arxiv_id":"2104.08048","repositories_listed":1,"syntology":null},{"url":"/paper/ecole-a-library-for-learning-inside-milp","slug":"ecole-a-library-for-learning-inside-milp","title":"Ecole: A Library for Learning Inside MILP Solvers","date":"2021-04-06","arxiv_id":"2104.02828","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-semi-supervised-learning-and-more-a","slug":"fairness-semi-supervised-learning-and-more-a","title":"Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints","date":"2021-03-02","arxiv_id":"2103.02013","repositories_listed":1,"syntology":null},{"url":"/paper/seapearl-a-constraint-programming-solver","slug":"seapearl-a-constraint-programming-solver","title":"SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning","date":"2021-02-18","arxiv_id":"2102.09193","repositories_listed":1,"syntology":null},{"url":"/paper/learning-general-policies-from-small-examples","slug":"learning-general-policies-from-small-examples","title":"Learning General Policies from Small Examples Without Supervision","date":"2021-01-03","arxiv_id":"2101.00692","repositories_listed":1,"syntology":null},{"url":"/paper/neural-knapsack-a-neural-network-based-solver","slug":"neural-knapsack-a-neural-network-based-solver","title":"Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem","date":"2020-12-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-with-lin","slug":"combining-reinforcement-learning-with-lin","title":"Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem","date":"2020-12-08","arxiv_id":"2012.04461","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-deep-reinforcement-learning-for","slug":"geometric-deep-reinforcement-learning-for","title":"Geometric Deep Reinforcement Learning for Dynamic DAG Scheduling","date":"2020-11-09","arxiv_id":"2011.04333","repositories_listed":1,"syntology":null},{"url":"/paper/firecommander-an-interactive-probabilistic","slug":"firecommander-an-interactive-probabilistic","title":"FireCommander: An Interactive, Probabilistic Multi-agent Environment for Heterogeneous Robot Teams","date":"2020-10-31","arxiv_id":"2011.00165","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-with-combinatorial","slug":"reinforcement-learning-with-combinatorial","title":"Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing","date":"2020-10-22","arxiv_id":"2010.12001","repositories_listed":1,"syntology":null},{"url":"/paper/feature-importance-ranking-for-deep-learning","slug":"feature-importance-ranking-for-deep-learning","title":"Feature Importance Ranking for Deep Learning","date":"2020-10-18","arxiv_id":"2010.08973","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/feature-importance-ranking-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2010.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08973"}},"official":{"repos":["maksym33/FeatureImportanceDL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/caching-in-networks-without-regret","slug":"caching-in-networks-without-regret","title":"LeadCache: Regret-Optimal Caching in Networks","date":"2020-09-17","arxiv_id":"2009.08228","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-tan-structure-learning-for","slug":"differentiable-tan-structure-learning-for","title":"Differentiable TAN Structure Learning for Bayesian Network Classifiers","date":"2020-08-21","arxiv_id":"2008.09566","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-consensus-maximization-and-model","slug":"simultaneous-consensus-maximization-and-model","title":"Revisiting Robust Model Fitting Using Truncated Loss","date":"2020-08-04","arxiv_id":"2008.01574","repositories_listed":1,"syntology":null},{"url":"/paper/deep-graph-matching-via-blackbox-1","slug":"deep-graph-matching-via-blackbox-1","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/positive-semidefinite-matrix-factorization-a","slug":"positive-semidefinite-matrix-factorization-a","title":"Positive Semidefinite Matrix Factorization: A Connection with Phase Retrieval and Affine Rank Minimization","date":"2020-07-24","arxiv_id":"2007.12364","repositories_listed":1,"syntology":null},{"url":"/paper/curriculum-learning-for-multilevel-budgeted","slug":"curriculum-learning-for-multilevel-budgeted","title":"Curriculum learning for multilevel budgeted combinatorial problems","date":"2020-07-07","arxiv_id":"2007.03151","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/curriculum-learning-for-multilevel-budgeted#ran","syntology_url":"https://syntology.ai/paper/2007.03151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03151"}},"official":{"repos":["AdelNabli/MCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/belief-propagation-neural-networks","slug":"belief-propagation-neural-networks","title":"Belief Propagation Neural Networks","date":"2020-07-01","arxiv_id":"2007.00295","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/belief-propagation-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.00295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00295"}},"official":{"repos":["jkuck/bpnn"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/learning-what-to-defer-for-maximum","slug":"learning-what-to-defer-for-maximum","title":"Learning What to Defer for Maximum Independent Sets","date":"2020-06-17","arxiv_id":"2006.09607","repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-and-1","slug":"combining-reinforcement-learning-and-1","title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","date":"2020-06-02","arxiv_id":"2006.01610","repositories_listed":1,"syntology":null},{"url":"/paper/provably-good-solutions-to-the-knapsack","slug":"provably-good-solutions-to-the-knapsack","title":"Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size","date":"2020-05-28","arxiv_id":"2005.14105","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-partial-removal-a-neural-network","slug":"dynamic-partial-removal-a-neural-network","title":"Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search","date":"2020-05-19","arxiv_id":"2005.09330","repositories_listed":1,"syntology":null},{"url":"/paper/generalization-of-machine-learning-for","slug":"generalization-of-machine-learning-for","title":"Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems","date":"2020-05-12","arxiv_id":"2005.05847","repositories_listed":1,"syntology":null},{"url":"/paper/natural-evolution-strategies-and-quantum","slug":"natural-evolution-strategies-and-quantum","title":"Natural evolution strategies and variational Monte Carlo","date":"2020-05-09","arxiv_id":"2005.04447","repositories_listed":1,"syntology":null},{"url":"/paper/a-learning-based-iterative-method-for-solving","slug":"a-learning-based-iterative-method-for-solving","title":"A Learning-based Iterative Method for Solving Vehicle Routing Problems","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enriching-documents-with-compact","slug":"enriching-documents-with-compact","title":"Enriching Documents with Compact, Representative, Relevant Knowledge Graphs","date":"2020-05-01","arxiv_id":"2005.00153","repositories_listed":1,"syntology":null},{"url":"/paper/ants-can-orienteer-a-thief-in-their-robbery","slug":"ants-can-orienteer-a-thief-in-their-robbery","title":"Ants can orienteer a thief in their robbery","date":"2020-04-15","arxiv_id":"2004.07017","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-algorithm-for-retrosynthesis","slug":"a-bayesian-algorithm-for-retrosynthesis","title":"A Bayesian algorithm for retrosynthesis","date":"2020-03-06","arxiv_id":"2003.03190","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":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) · 1 unverified","sample_list":"/paper/a-bayesian-algorithm-for-retrosynthesis#ran","syntology_url":"https://syntology.ai/paper/2003.03190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03190"}},"official":{"repos":["zguo235/bayesian_retro"],"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/automatic-cost-function-learning-with","slug":"automatic-cost-function-learning-with","title":"Learning Interpretable Error Functions for Combinatorial Optimization Problem Modeling","date":"2020-02-23","arxiv_id":"2002.09811","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-sampling-without-replacement-for","slug":"incremental-sampling-without-replacement-for","title":"Incremental Sampling Without Replacement for Sequence Models","date":"2020-02-21","arxiv_id":"2002.09067","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incremental-sampling-without-replacement-for#ran","syntology_url":"https://syntology.ai/paper/2002.09067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09067"}},"official":{"repos":["google-research/unique-randomizer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-enhanced-quantum","slug":"reinforcement-learning-enhanced-quantum","title":"Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization","date":"2020-02-11","arxiv_id":"2002.04676","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/reinforcement-learning-enhanced-quantum#ran","syntology_url":"https://syntology.ai/paper/2002.04676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04676"}},"official":{"repos":["BeloborodovDS/SIMCIM-RL"],"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/fair-correlation-clustering","slug":"fair-correlation-clustering","title":"Fair Correlation Clustering","date":"2020-02-06","arxiv_id":"2002.02274","repositories_listed":1,"syntology":null},{"url":"/paper/implementing-a-gpu-based-parallel-max-min-ant","slug":"implementing-a-gpu-based-parallel-max-min-ant","title":"Implementing a GPU-based parallel MAX-MIN Ant System","date":"2020-01-18","arxiv_id":"2003.11902","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-sampling-of-enlarged-neighborhood","slug":"targeted-sampling-of-enlarged-neighborhood","title":"Targeted sampling of enlarged neighborhood via Monte Carlo tree search for TSP","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-adaptive-simulated-annealing-em-algorithm","slug":"an-adaptive-simulated-annealing-em-algorithm","title":"An adaptive simulated annealing EM algorithm for inference on non-homogeneous hidden Markov models","date":"2019-12-20","arxiv_id":"1912.09733","repositories_listed":1,"syntology":null},{"url":"/paper/protecting-geolocation-privacy-of-photo","slug":"protecting-geolocation-privacy-of-photo","title":"Protecting Geolocation Privacy of Photo Collections","date":"2019-12-04","arxiv_id":"1912.02085","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-matching-network-learning","slug":"neural-graph-matching-network-learning","title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","date":"2019-11-26","arxiv_id":"1911.11308","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-optimize-variational-quantum","slug":"learning-to-optimize-variational-quantum","title":"Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems","date":"2019-11-25","arxiv_id":"1911.11071","repositories_listed":1,"syntology":null},{"url":"/paper/smart-predict-and-optimize-for-hard","slug":"smart-predict-and-optimize-for-hard","title":"Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems","date":"2019-11-22","arxiv_id":"1911.10092","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":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) · 7 unverified","sample_list":"/paper/smart-predict-and-optimize-for-hard#ran","syntology_url":"https://syntology.ai/paper/1911.10092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10092"}},"official":{"repos":["JayMan91/aaai_predit_then_optimize"],"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/black-box-combinatorial-optimization-using","slug":"black-box-combinatorial-optimization-using","title":"Black-box Combinatorial Optimization using Models with Integer-valued Minima","date":"2019-11-20","arxiv_id":"1911.08817","repositories_listed":1,"syntology":null},{"url":"/paper/multidataset-independent-subspace-analysis","slug":"multidataset-independent-subspace-analysis","title":"Multidataset Independent Subspace Analysis with Application to Multimodal Fusion","date":"2019-11-11","arxiv_id":"1911.04048","repositories_listed":1,"syntology":null},{"url":"/paper/open-the-boxes-of-words-incorporating-sememes","slug":"open-the-boxes-of-words-incorporating-sememes","title":"Word-level Textual Adversarial Attacking as Combinatorial Optimization","date":"2019-10-27","arxiv_id":"1910.12196","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/open-the-boxes-of-words-incorporating-sememes#ran","syntology_url":"https://syntology.ai/paper/1910.12196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12196"}},"official":{"repos":["thunlp/SememePSO-Attack"],"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/kernels-of-mallows-models-under-the-hamming","slug":"kernels-of-mallows-models-under-the-hamming","title":"Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem","date":"2019-10-19","arxiv_id":"1910.08800","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-evaluate-machine-learning-approaches","slug":"how-to-evaluate-machine-learning-approaches","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","date":"2019-09-28","arxiv_id":"1909.13121","repositories_listed":1,"syntology":null},{"url":"/paper/run-csp-unsupervised-learning-of-message","slug":"run-csp-unsupervised-learning-of-message","title":"Graph Neural Networks for Maximum Constraint Satisfaction","date":"2019-09-18","arxiv_id":"1909.08387","repositories_listed":1,"syntology":null},{"url":"/paper/global-optimal-path-based-clustering","slug":"global-optimal-path-based-clustering","title":"Global Optimal Path-Based Clustering Algorithm","date":"2019-09-17","arxiv_id":"1909.07774","repositories_listed":1,"syntology":null},{"url":"/paper/automated-quantum-programming-via","slug":"automated-quantum-programming-via","title":"Automated quantum programming via reinforcement learning for combinatorial optimization","date":"2019-08-21","arxiv_id":"1908.08054","repositories_listed":1,"syntology":null},{"url":"/paper/co-training-for-policy-learning","slug":"co-training-for-policy-learning","title":"Co-training for Policy Learning","date":"2019-07-03","arxiv_id":"1907.04484","repositories_listed":1,"syntology":null},{"url":"/paper/submodular-batch-selection-for-training-deep","slug":"submodular-batch-selection-for-training-deep","title":"Submodular Batch Selection for Training Deep Neural Networks","date":"2019-06-20","arxiv_id":"1906.08771","repositories_listed":1,"syntology":null},{"url":"/paper/curriculum-learning-for-cumulative-return","slug":"curriculum-learning-for-cumulative-return","title":"Curriculum Learning for Cumulative Return Maximization","date":"2019-06-13","arxiv_id":"1906.06178","repositories_listed":1,"syntology":null},{"url":"/paper/causal-discovery-with-reinforcement-learning","slug":"causal-discovery-with-reinforcement-learning","title":"Causal Discovery with Reinforcement Learning","date":"2019-06-11","arxiv_id":"1906.04477","repositories_listed":1,"syntology":null},{"url":"/paper/exact-k-recommendation-via-maximal-clique","slug":"exact-k-recommendation-via-maximal-clique","title":"Exact-K Recommendation via Maximal Clique Optimization","date":"2019-05-17","arxiv_id":"1905.07089","repositories_listed":1,"syntology":null},{"url":"/paper/parsimonious-black-box-adversarial-attacks","slug":"parsimonious-black-box-adversarial-attacks","title":"Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimization","date":"2019-05-16","arxiv_id":"1905.06635","repositories_listed":1,"syntology":null},{"url":"/paper/balanced-crossover-operators-in-genetic","slug":"balanced-crossover-operators-in-genetic","title":"Balanced Crossover Operators in Genetic Algorithms","date":"2019-04-23","arxiv_id":"1904.10494","repositories_listed":1,"syntology":null},{"url":"/paper/bottleneck-potentials-in-markov-random-fields","slug":"bottleneck-potentials-in-markov-random-fields","title":"Bottleneck potentials in Markov Random Fields","date":"2019-04-17","arxiv_id":"1904.08080","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-learning-of-sequential-choice-bandit","slug":"dynamic-learning-of-sequential-choice-bandit","title":"Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue","date":"2019-03-19","arxiv_id":"1903.08193","repositories_listed":1,"syntology":null},{"url":"/paper/attack-graph-obfuscation","slug":"attack-graph-obfuscation","title":"Attack Graph Obfuscation","date":"2019-03-06","arxiv_id":"1903.02601","repositories_listed":1,"syntology":null},{"url":"/paper/fast-parallel-algorithms-for-feature","slug":"fast-parallel-algorithms-for-feature","title":"Fast Parallel Algorithms for Statistical Subset Selection Problems","date":"2019-03-06","arxiv_id":"1903.02656","repositories_listed":1,"syntology":null},{"url":"/paper/a-cooperative-multi-agent-reinforcement","slug":"a-cooperative-multi-agent-reinforcement","title":"A Cooperative Multi-Agent Reinforcement Learning Framework for Resource Balancing in Complex Logistics Network","date":"2019-03-02","arxiv_id":"1903.00714","repositories_listed":1,"syntology":null},{"url":"/paper/constrained-optimization-under-uncertainty","slug":"constrained-optimization-under-uncertainty","title":"Constrained optimization under uncertainty for decision-making problems: Application to Real-Time Strategy games","date":"2019-01-03","arxiv_id":"1901.00942","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-robust-kidney-exchange","slug":"scalable-robust-kidney-exchange","title":"Scalable Robust Kidney Exchange","date":"2018-11-08","arxiv_id":"1811.03532","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/scalable-robust-kidney-exchange#ran","syntology_url":"https://syntology.ai/paper/1811.03532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03532"}},"official":{"repos":["duncanmcelfresh/RobustKidneyExchange"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-local-rewriting-for-combinatorial","slug":"automatic-local-rewriting-for-combinatorial","title":"Learning to Perform Local Rewriting for Combinatorial Optimization","date":"2018-09-30","arxiv_id":"1810.00337","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/improving-optimization-bounds-using-machine","slug":"improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","arxiv_id":"1809.03359","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/improving-optimization-bounds-using-machine#ran","syntology_url":"https://syntology.ai/paper/1809.03359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03359"}},"official":{"repos":["qcappart/learning-DD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-best-subset-selection-coordinate-descent","slug":"fast-best-subset-selection-coordinate-descent","title":"Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms","date":"2018-03-05","arxiv_id":"1803.01454","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-as-a-mixed-convex-combinatorial","slug":"deep-learning-as-a-mixed-convex-combinatorial","title":"Deep Learning as a Mixed Convex-Combinatorial Optimization Problem","date":"2017-10-31","arxiv_id":"1710.11573","repositories_listed":1,"syntology":null},{"url":"/paper/the-exact-solution-to-rank-1-l1-norm-tucker2","slug":"the-exact-solution-to-rank-1-l1-norm-tucker2","title":"The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition","date":"2017-10-31","arxiv_id":"1710.11306","repositories_listed":1,"syntology":null},{"url":"/paper/quadratic-unconstrained-binary-optimization","slug":"quadratic-unconstrained-binary-optimization","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","date":"2017-05-27","arxiv_id":"1705.09844","repositories_listed":1,"syntology":null},{"url":"/paper/joint-graph-decomposition-and-node-labeling","slug":"joint-graph-decomposition-and-node-labeling","title":"Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications","date":"2016-11-14","arxiv_id":"1611.04399","repositories_listed":1,"syntology":null},{"url":"/paper/generative-adversarial-networks-in-estimation","slug":"generative-adversarial-networks-in-estimation","title":"Generative Adversarial Networks in Estimation of Distribution Algorithms for Combinatorial Optimization","date":"2015-09-30","arxiv_id":"1509.09235","repositories_listed":1,"syntology":null},{"url":"/paper/deep-boltzmann-machines-in-estimation-of","slug":"deep-boltzmann-machines-in-estimation-of","title":"Deep Boltzmann Machines in Estimation of Distribution Algorithms for Combinatorial Optimization","date":"2015-09-22","arxiv_id":"1509.06535","repositories_listed":1,"syntology":null},{"url":"/paper/denoising-autoencoders-for-fast-combinatorial","slug":"denoising-autoencoders-for-fast-combinatorial","title":"Denoising Autoencoders for fast Combinatorial Black Box Optimization","date":"2015-03-06","arxiv_id":"1503.01954","repositories_listed":1,"syntology":null},{"url":"/paper/an-ant-colony-optimization-algorithm-for-job","slug":"an-ant-colony-optimization-algorithm-for-job","title":"An ant colony optimization algorithm for job shop scheduling problem","date":"2013-09-19","arxiv_id":"1309.5110","repositories_listed":1,"syntology":null},{"url":"/paper/regret-in-online-combinatorial-optimization","slug":"regret-in-online-combinatorial-optimization","title":"Regret in Online Combinatorial Optimization","date":"2012-04-20","arxiv_id":"1204.4710","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-ensembles-a-knowledge-reuse-framework","slug":"cluster-ensembles-a-knowledge-reuse-framework","title":"Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions","date":"2002-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"b8637f8ac2f6aad6d9bbe957e2c1dc4099863284bfde24502d5db7f46a8852c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}