{"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/8","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":8,"pages_in_order":13,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/combinatorial-optimization/papers/9","papers":[{"url":null,"slug":"training-deep-boltzmann-networks-with-sparse","title":"Training Deep Boltzmann Networks with Sparse Ising Machines","date":"2023-03-19","arxiv_id":"2303.10728","repositories_listed":0,"syntology":null},{"url":null,"slug":"redrawing-attendance-boundaries-to-promote","title":"Redrawing attendance boundaries to promote racial and ethnic diversity in elementary schools","date":"2023-03-14","arxiv_id":"2303.07603","repositories_listed":0,"syntology":null},{"url":null,"slug":"material-identification-from-radiographs","title":"Material Identification From Radiographs Without Energy Resolution","date":"2023-03-10","arxiv_id":"2303.06005","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-multi-objective-algorithms-for","title":"Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits","date":"2023-03-03","arxiv_id":"2303.01695","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-as-chita-neural-network-pruning-with","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","date":"2023-02-28","arxiv_id":"2302.14623","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-supporting-examples-for-in-context","title":"Finding Support Examples for In-Context Learning","date":"2023-02-27","arxiv_id":"2302.13539","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforced-learning-heuristic-tested-on","title":"Deep reinforced learning heuristic tested on spin-glass ground states: The larger picture","date":"2023-02-21","arxiv_id":"2302.10848","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-graph-genetic-algorithm-based","title":"Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Design","date":"2023-02-17","arxiv_id":"2302.09040","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-full-stack-view-of-probabilistic-computing","title":"A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms","date":"2023-02-13","arxiv_id":"2302.06457","repositories_listed":0,"syntology":null},{"url":null,"slug":"expediting-distributed-dnn-training-with","title":"Expediting Distributed DNN Training with Device Topology-Aware Graph Deployment","date":"2023-02-13","arxiv_id":"2302.06126","repositories_listed":0,"syntology":null},{"url":null,"slug":"digging-deeper-operator-analysis-for","title":"Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions","date":"2023-02-12","arxiv_id":"2302.05890","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-random-matrices-and-applications-to","title":"Nonlinear Random Matrices and Applications to the Sum of Squares Hierarchy","date":"2023-02-09","arxiv_id":"2302.04462","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximately-optimal-core-shapes-for-tensor","title":"Approximately Optimal Core Shapes for Tensor Decompositions","date":"2023-02-08","arxiv_id":"2302.03886","repositories_listed":0,"syntology":null},{"url":null,"slug":"reply-to-inability-of-a-graph-neural-network","title":"Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems","date":"2023-02-03","arxiv_id":"2303.12096","repositories_listed":0,"syntology":null},{"url":null,"slug":"reply-to-modern-graph-neural-networks-do","title":"Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","date":"2023-02-03","arxiv_id":"2302.03602","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-large-neighborhoods-for-integer","title":"Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning","date":"2023-02-03","arxiv_id":"2302.01578","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-dive-in-branch-and-bound","title":"Learning To Dive In Branch And Bound","date":"2023-01-24","arxiv_id":"2301.09943","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-learning-for-the-flexible-job-shop","title":"Two-Stage Learning For the Flexible Job Shop Scheduling Problem","date":"2023-01-23","arxiv_id":"2301.09703","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-correlation-based-discretization-of","title":"Efficient correlation-based discretization of continuous variables for annealing machines","date":"2023-01-18","arxiv_id":"2301.07244","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-combinatorial-semi-bandit-approach-to","title":"A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles","date":"2023-01-17","arxiv_id":"2301.07156","repositories_listed":0,"syntology":null},{"url":null,"slug":"laga-a-learning-adaptive-genetic-algorithm","title":"Mathematical Models and Reinforcement Learning based Evolutionary Algorithm Framework for Satellite Scheduling Problem","date":"2023-01-07","arxiv_id":"2301.02764","repositories_listed":0,"syntology":null},{"url":null,"slug":"pa-gm-position-aware-learning-of-embedding","title":"PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching","date":"2023-01-05","arxiv_id":"2301.01932","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learning-framework-for-neighbor","title":"A machine learning framework for neighbor generation in metaheuristic search","date":"2022-12-22","arxiv_id":"2212.11451","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-local-optima-network-view-of-real-function","title":"A Local Optima Network View of Real Function Fitness Landscapes","date":"2022-12-20","arxiv_id":"2212.10254","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-repeatedly-solve-routing-problems","title":"Learning to repeatedly solve routing problems","date":"2022-12-15","arxiv_id":"2212.08101","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-branching-relaxation-heuristics-for","title":"Local Branching Relaxation Heuristics for Integer Linear Programs","date":"2022-12-15","arxiv_id":"2212.08183","repositories_listed":0,"syntology":null},{"url":null,"slug":"security-defense-of-large-scale-networks","title":"Security Defense of Large Scale Networks Under False Data Injection Attacks: An Attack Detection Scheduling Approach","date":"2022-12-11","arxiv_id":"2212.05500","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-optimization-with-higher-order","title":"Efficient Optimization with Higher-Order Ising Machines","date":"2022-12-07","arxiv_id":"2212.03426","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-multi-truck","title":"Reinforcement Learning for Multi-Truck Vehicle Routing Problems","date":"2022-11-30","arxiv_id":"2211.17078","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-hyperparameter-tuning-for-ising-machines","title":"Fast Hyperparameter Tuning for Ising Machines","date":"2022-11-29","arxiv_id":"2211.15869","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-principal-component-design-fast","title":"Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls","date":"2022-11-28","arxiv_id":"2211.15241","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-branching-heuristics-from-graph","title":"Learning Branching Heuristics from Graph Neural Networks","date":"2022-11-26","arxiv_id":"2211.14405","repositories_listed":0,"syntology":null},{"url":null,"slug":"hide-and-seek-scaling-machine-learning-for","title":"Arbitrarily Large Labelled Random Satisfiability Formulas for Machine Learning Training","date":"2022-11-21","arxiv_id":"2211.15368","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-causal-learning-representation-discovery","title":"Deep Causal Learning: Representation, Discovery and Inference","date":"2022-11-07","arxiv_id":"2211.03374","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-influence-maximization-from-an-ml","title":"A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization","date":"2022-11-06","arxiv_id":"2211.03074","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-for-classification-with-1","title":"Feature Selection for Classification with QAOA","date":"2022-11-05","arxiv_id":"2211.02861","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-sequence-set-optimization-for-cdma","title":"Binary sequence set optimization for CDMA applications via mixed-integer quadratic programming","date":"2022-11-01","arxiv_id":"2211.00285","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adaptive-evolutionary-computation","title":"Learning Adaptive Evolutionary Computation for Solving Multi-Objective Optimization Problems","date":"2022-11-01","arxiv_id":"2211.09719","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-heuristics-for-the-maximum-clique","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations","date":"2022-10-30","arxiv_id":"2210.16963","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-pareto-set-prediction-with-graph","title":"End-to-End Pareto Set Prediction with Graph Neural Networks for Multi-objective Facility Location","date":"2022-10-27","arxiv_id":"2210.15220","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-discrete-directed-acyclic-graphs-via","title":"Learning Discrete Directed Acyclic Graphs via Backpropagation","date":"2022-10-27","arxiv_id":"2210.15353","repositories_listed":0,"syntology":null},{"url":null,"slug":"revealed-preferences-of-one-sided-matching","title":"Revealed Preferences of One-Sided Matching","date":"2022-10-25","arxiv_id":"2210.14388","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-network-multi-objective-evolutionary","title":"Sub-network Multi-objective Evolutionary Algorithm for Filter Pruning","date":"2022-10-22","arxiv_id":"2211.01957","repositories_listed":0,"syntology":null},{"url":null,"slug":"surco-learning-linear-surrogates-for","title":"SurCo: Learning Linear Surrogates For Combinatorial Nonlinear Optimization Problems","date":"2022-10-22","arxiv_id":"2210.12547","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-decision-tree-classifier-in","title":"Application of Decision Tree Classifier in Detection of Specific Denial of Service Attacks with Genetic Algorithm Based Feature Selection on NSL-KDD","date":"2022-10-19","arxiv_id":"2210.10232","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-practical-explainability-with-cluster","title":"Towards Practical Explainability with Cluster Descriptors","date":"2022-10-18","arxiv_id":"2210.10662","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-and-exploring-promising-search-space","title":"Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem","date":"2022-10-08","arxiv_id":"2210.03918","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-approach-for-multi","title":"Reinforcement Learning Approach for Multi-Agent Flexible Scheduling Problems","date":"2022-10-07","arxiv_id":"2210.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-moving-horizon-estimation-for","title":"Robust Bayesian Inference for Moving Horizon Estimation","date":"2022-10-05","arxiv_id":"2210.02166","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-modularity-in-industrial","title":"Towards Efficient Modularity in Industrial Drying: A Combinatorial Optimization Viewpoint","date":"2022-10-05","arxiv_id":"2210.01971","repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-off-quality-for-efficiency-of","title":"Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs","date":"2022-09-29","arxiv_id":"2209.14825","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-good-is-neural-combinatorial-optimization","title":"How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem","date":"2022-09-22","arxiv_id":"2209.10913","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-obstacle-avoiding-lattice-paths","title":"Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees","date":"2022-09-12","arxiv_id":"2209.05187","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-q-learning-for-antibody-design","title":"Structured Q-learning For Antibody Design","date":"2022-09-10","arxiv_id":"2209.04698","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-for-local-search-and","title":"Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?","date":"2022-09-09","arxiv_id":"2210.12075","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-coevolutionary-hybrid-nsga-ii","title":"Cooperative coevolutionary hybrid NSGA-II with Linkage Measurement Minimization for Large-scale Multi-objective optimization","date":"2022-08-29","arxiv_id":"2208.13415","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nested-genetic-algorithm-for-explaining","title":"A Nested Genetic Algorithm for Explaining Classification Data Sets with Decision Rules","date":"2022-08-23","arxiv_id":"2209.07575","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-optimization-solving-by","title":"Combinatorial optimization solving by coherent Ising machines based on spiking neural networks","date":"2022-08-16","arxiv_id":"2208.07502","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-discovery-in-probabilistic-networks","title":"Causal Effect Identification in Uncertain Causal Networks","date":"2022-08-09","arxiv_id":"2208.04627","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-vehicle-routing-problem-with-deep","title":"Solving the vehicle routing problem with deep reinforcement learning","date":"2022-07-30","arxiv_id":"2208.00202","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-quality-diversity-algorithms-for","title":"Analysis of Quality Diversity Algorithms for the Knapsack Problem","date":"2022-07-28","arxiv_id":"2207.14037","repositories_listed":0,"syntology":null},{"url":null,"slug":"jdrec-practical-actor-critic-framework-for","title":"JDRec: Practical Actor-Critic Framework for Online Combinatorial Recommender System","date":"2022-07-27","arxiv_id":"2207.13311","repositories_listed":0,"syntology":null},{"url":null,"slug":"annealed-training-for-combinatorial","title":"Annealed Training for Combinatorial Optimization on Graphs","date":"2022-07-23","arxiv_id":"2207.11542","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-partial-set-cover-with","title":"Differentially Private Partial Set Cover with Applications to Facility Location","date":"2022-07-21","arxiv_id":"2207.10240","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimization-for-macro-placement","title":"Bayesian Optimization for Macro Placement","date":"2022-07-18","arxiv_id":"2207.08398","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-topological-ordering-for-computation","title":"Neural Topological Ordering for Computation Graphs","date":"2022-07-13","arxiv_id":"2207.05899","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-ranging-and-phase-offset-estimation-for","title":"Joint Ranging and Phase Offset Estimation for Multiple Drones using ADS-B Signatures","date":"2022-07-12","arxiv_id":"2207.05370","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conditional-gradient-homotopy-method-with","title":"A conditional gradient homotopy method with applications to Semidefinite Programming","date":"2022-07-07","arxiv_id":"2207.03101","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-round-for-post-training","title":"Attention Round for Post-Training Quantization","date":"2022-07-07","arxiv_id":"2207.03088","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-quality-of-machine-permutations","title":"Learning the Quality of Machine Permutations in Job Shop Scheduling","date":"2022-07-07","arxiv_id":"2207.03244","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-neural-prediction-based-acceleration","title":"The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems","date":"2022-07-04","arxiv_id":"2207.01411","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-behaviour-of-d-wave-quantum","title":"Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations","date":"2022-07-01","arxiv_id":"2207.00253","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-neural-architecture-search-with","title":"Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization","date":"2022-06-28","arxiv_id":"2206.14115","repositories_listed":0,"syntology":null},{"url":null,"slug":"quant-bnb-a-scalable-branch-and-bound-method","title":"Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features","date":"2022-06-23","arxiv_id":"2206.11844","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-influence-of-local-search-over-genetic","title":"The Influence of Local Search over Genetic Algorithms with Balanced Representations","date":"2022-06-22","arxiv_id":"2206.10974","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-understanding-genetic-drift-to-a-smart-1","title":"From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms","date":"2022-06-18","arxiv_id":"2206.09090","repositories_listed":0,"syntology":null},{"url":null,"slug":"concentration-of-data-encoding-in","title":"Concentration of Data Encoding in Parameterized Quantum Circuits","date":"2022-06-16","arxiv_id":"2206.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-exact","title":"Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch","date":"2022-06-14","arxiv_id":"2206.06965","repositories_listed":0,"syntology":null},{"url":null,"slug":"phml-dyr-a-physics-informed-ml-framework-for","title":"Grid-SiPhyR: An end-to-end learning to optimize framework for combinatorial problems in power systems","date":"2022-06-11","arxiv_id":"2206.06789","repositories_listed":0,"syntology":null},{"url":null,"slug":"set-interdependence-transformer-set-to","title":"Set Interdependence Transformer: Set-to-Sequence Neural Networks for Permutation Learning and Structure Prediction","date":"2022-06-08","arxiv_id":"2206.03720","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-optimization-for-low-bit-width","title":"Combinatorial optimization for low bit-width neural networks","date":"2022-06-04","arxiv_id":"2206.02006","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-of-neural-combinatorial","title":"On the Generalization of Neural Combinatorial Optimization Heuristics","date":"2022-06-01","arxiv_id":"2206.00787","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-as-a-service-a-privacy-preserving","title":"Evolution as a Service: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization","date":"2022-05-27","arxiv_id":"2205.13948","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-fellowship-of-the-dyson-ring-act-friends","title":"The Fellowship of the Dyson Ring: ACT&Friends' Results and Methods for GTOC 11","date":"2022-05-13","arxiv_id":"2205.10124","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-introduction-to-quantum-machine-learning-1","title":"An Introduction to Quantum Machine Learning for Engineers","date":"2022-05-11","arxiv_id":"2205.09510","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuromimetic-linear-systems-resilience-and","title":"Neuromimetic Linear Systems -- Resilience and Learning","date":"2022-05-10","arxiv_id":"2205.05013","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-combinatorial-optimization-a-new","title":"Neural Combinatorial Optimization: a New Player in the Field","date":"2022-05-03","arxiv_id":"2205.01356","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-circuit-depth-scaling-for-quantum","title":"On Circuit Depth Scaling For Quantum Approximate Optimization","date":"2022-05-03","arxiv_id":"2205.01698","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-online-3","title":"Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer","date":"2022-04-25","arxiv_id":"2204.11477","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-online-combinatorial-optimization","title":"Smoothed Online Combinatorial Optimization Using Imperfect Predictions","date":"2022-04-23","arxiv_id":"2204.10979","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-core-guided-and-hitting-set-algorithms","title":"New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization","date":"2022-04-22","arxiv_id":"2204.10856","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-tensor-network-contraction-using","title":"Optimizing Tensor Network Contraction Using Reinforcement Learning","date":"2022-04-18","arxiv_id":"2204.09052","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-qubo-solver-using-black-box","title":"Application of QUBO solver using black-box optimization to structural design for resonance avoidance","date":"2022-04-11","arxiv_id":"2204.04906","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-trajectory-design-and","title":"Energy-Sensitive Trajectory Design and Restoration Areas Allocation for UAV-Enabled Grassland Restoration","date":"2022-04-10","arxiv_id":"2204.04666","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-minimum-cost-multicuts","title":"Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks","date":"2022-04-04","arxiv_id":"2204.01366","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-prediction-of-relevant-scenarios","title":"Data-driven Prediction of Relevant Scenarios for Robust Combinatorial Optimization","date":"2022-03-30","arxiv_id":"2203.16642","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distribution-evolutionary-algorithm-for","title":"A Distribution Evolutionary Algorithm for the Graph Coloring Problem","date":"2022-03-29","arxiv_id":"2203.15162","repositories_listed":0,"syntology":null},{"url":null,"slug":"molgensurvey-a-systematic-survey-in-machine","title":"MolGenSurvey: A Systematic Survey in Machine Learning Models for Molecule Design","date":"2022-03-28","arxiv_id":"2203.14500","repositories_listed":0,"syntology":null},{"url":null,"slug":"focused-jump-and-repair-constraint-handling","title":"Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems Closed Under Induced Subgraphs","date":"2022-03-25","arxiv_id":"2203.13877","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-camera-placements-for-overlapped","title":"Optimizing Camera Placements for Overlapped Coverage with 3D Camera Projections","date":"2022-03-20","arxiv_id":"2203.10479","repositories_listed":0,"syntology":null}],"record_sha256":"15cd04a288e52d03c27ce7a7ac782a4da47942332baee36f17bf0030aa91e20d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}