{"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/9","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":9,"pages_in_order":13,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/combinatorial-optimization/papers/10","papers":[{"url":null,"slug":"make-the-difference-computationally-trivial","title":"A Simple and Computationally Trivial Estimator for Grouped Fixed Effects Models","date":"2022-03-16","arxiv_id":"2203.08879","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differentiable-approach-to-combinatorial","title":"A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks","date":"2022-03-15","arxiv_id":"2203.08209","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-compositional-algorithm-for-the-conflict","title":"A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem","date":"2022-03-14","arxiv_id":"2203.06977","repositories_listed":0,"syntology":null},{"url":null,"slug":"set-valued-prediction-in-hierarchical","title":"Set-valued prediction in hierarchical classification with constrained representation complexity","date":"2022-03-13","arxiv_id":"2203.06676","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-for-solving-mixed-integer","title":"A Survey for Solving Mixed Integer Programming via Machine Learning","date":"2022-03-06","arxiv_id":"2203.02878","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-driven-column-generation-algorithm-for","title":"A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry","date":"2022-02-25","arxiv_id":"2202.12466","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-schedule-heuristics-for-the-1","title":"Learning to Schedule Heuristics for the Simultaneous Stochastic Optimization of Mining Complexes","date":"2022-02-25","arxiv_id":"2202.12866","repositories_listed":0,"syntology":null},{"url":null,"slug":"noncoherent-massive-mimo-with-embedded-one","title":"Noncoherent Massive MIMO with Embedded One-Way Function Physical Layer Security","date":"2022-02-24","arxiv_id":"2202.11893","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-opportunities-and","title":"Reinforcement Learning in Practice: Opportunities and Challenges","date":"2022-02-23","arxiv_id":"2202.11296","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-framework-for-server","title":"Reinforcement Learning Framework for Server Placement and Workload Allocation in Multi-Access Edge Computing","date":"2022-02-21","arxiv_id":"2203.07998","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-construction-of-perfectly","title":"Evolutionary Construction of Perfectly Balanced Boolean Functions","date":"2022-02-16","arxiv_id":"2202.08221","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-subset-selection-for-big-data-via","title":"Feature subset selection for Big Data via Chaotic Binary Differential Evolution under Apache Spark","date":"2022-02-08","arxiv_id":"2202.03795","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-feature-space-of-tsp-instances","title":"Exploring the Feature Space of TSP Instances Using Quality Diversity","date":"2022-02-04","arxiv_id":"2202.02077","repositories_listed":0,"syntology":null},{"url":null,"slug":"heed-the-noise-in-performance-evaluations-in","title":"Heed the Noise in Performance Evaluations in Neural Architecture Search","date":"2022-02-04","arxiv_id":"2202.02078","repositories_listed":0,"syntology":null},{"url":null,"slug":"yordle-an-efficient-imitation-learning-for","title":"Yordle: An Efficient Imitation Learning for Branch and Bound","date":"2022-02-02","arxiv_id":"2202.01896","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivariant-neural-networks-for-recovery-of","title":"Equivariant neural networks for recovery of Hadamard matrices","date":"2022-01-31","arxiv_id":"2201.13157","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-ring-parametrized-variational-quantum","title":"Classical Simulation of Variational Quantum Classifiers using Tensor Rings","date":"2022-01-21","arxiv_id":"2201.08878","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-reinforcement-learning-algorithm","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch","date":"2022-01-17","arxiv_id":"2201.06213","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-advances-in-deep-learning-for-routing","title":"Recent Advances in Deep Learning for Routing Problems","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-to-solve-np-hard","title":"Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP","date":"2022-01-14","arxiv_id":"2201.05393","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quadratic-0-1-programming-approach-for-word","title":"A Quadratic 0-1 Programming Approach for Word Sense Disambiguation","date":"2022-01-13","arxiv_id":"2201.04877","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-permutation-invariant-networks-for-1","title":"Supervised Permutation Invariant Networks for Solving the CVRP with Bounded Fleet Size","date":"2022-01-05","arxiv_id":"2201.01529","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-combinatorial-optimization-beyond-the","title":"Neural combinatorial optimization beyond the TSP: Existing architectures under-represent graph structure","date":"2022-01-03","arxiv_id":"2201.00668","repositories_listed":0,"syntology":null},{"url":null,"slug":"mind-your-solver-on-adversarial-attack-and-1","title":"A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs","date":"2021-12-28","arxiv_id":"2201.00402","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepgantt-a-scalable-deep-learning-scheduler","title":"DeepGANTT: A Scalable Deep Learning Scheduler for Backscatter Networks","date":"2021-12-24","arxiv_id":"2112.12985","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-transformation-invariant-geometric","title":"Revisiting Transformation Invariant Geometric Deep Learning: Are Initial Representations All You Need?","date":"2021-12-23","arxiv_id":"2112.12345","repositories_listed":0,"syntology":null},{"url":null,"slug":"ml4co-is-gcnn-all-you-need-graph","title":"ML4CO: Is GCNN All You Need? Graph Convolutional Neural Networks Produce Strong Baselines For Combinatorial Optimization Problems, If Tuned and Trained Properly, on Appropriate Data","date":"2021-12-22","arxiv_id":"2112.12251","repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-injected-analog-ising-machines-enable","title":"Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning","date":"2021-12-21","arxiv_id":"2112.11534","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-for-robust-combinatorial","title":"Learning for Robust Combinatorial Optimization: Algorithm and Application","date":"2021-12-20","arxiv_id":"2112.10377","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-resource-allocation-problems-in","title":"Constrained Resource Allocation Problems in Communications: An Information-assisted Approach","date":"2021-12-07","arxiv_id":"2112.03512","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-measurement-scheduling-for","title":"Learning-based Measurement Scheduling for Loosely-Coupled Cooperative Localization","date":"2021-12-06","arxiv_id":"2112.02843","repositories_listed":0,"syntology":null},{"url":null,"slug":"multidimensional-assignment-problem-for","title":"Multidimensional Assignment Problem for multipartite entity resolution","date":"2021-12-06","arxiv_id":"2112.03346","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-machine-learning-the-bagel","title":"Constrained Machine Learning: The Bagel Framework","date":"2021-12-02","arxiv_id":"2112.01088","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-cluster-head-selection-and-trajectory","title":"Joint Cluster Head Selection and Trajectory Planning in UAV-Aided IoT Networks by Reinforcement Learning with Sequential Model","date":"2021-12-01","arxiv_id":"2112.00333","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimizing-polarization-and-disagreement-in-1","title":"Minimizing Polarization and Disagreement in Social Networks via Link Recommendation","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nn-baker-a-neural-network-infused-algorithmic","title":"NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-enhanced-explainer-for","title":"Reinforcement Learning Enhanced Explainer for Graph Neural Networks","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"model-rich-approaches-to-eliciting-weak","title":"Eliciting and Distinguishing Between Weak and Incomplete Preferences: Theory, Experiment and Computation","date":"2021-11-29","arxiv_id":"2111.14431","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonequilibrium-monte-carlo-for-unfreezing","title":"Nonequilibrium Monte Carlo for unfreezing variables in hard combinatorial optimization","date":"2021-11-26","arxiv_id":"2111.13628","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-schedule-heuristics-for-the","title":"Learning to Schedule Heuristics for the Simultaneous Stochastic Optimization of Mining Complexes","date":"2021-11-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reversible-action-design-for-combinatorial-1","title":"Reversible Action Design for Combinatorial Optimization with ReinforcementLearning","date":"2021-11-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"satnet-a-benchmark-for-satellite-scheduling","title":"SatNet: A Benchmark for Satellite Scheduling Optimization","date":"2021-11-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asteroid-flyby-cycler-trajectory-design-using","title":"Asteroid Flyby Cycler Trajectory Design Using Deep Neural Networks","date":"2021-11-23","arxiv_id":"2111.11858","repositories_listed":0,"syntology":null},{"url":null,"slug":"bigrad-differentiating-through-bilevel","title":"BiGrad: Differentiating through Bilevel Optimization Programming","date":"2021-11-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vulcan-solving-the-steiner-tree-problem-with","title":"Vulcan: Solving the Steiner Tree Problem with Graph Neural Networks and Deep Reinforcement Learning","date":"2021-11-21","arxiv_id":"2111.10810","repositories_listed":0,"syntology":null},{"url":null,"slug":"mc-cim-compute-in-memory-with-monte-carlo","title":"MC-CIM: Compute-in-Memory with Monte-Carlo Dropouts for Bayesian Edge Intelligence","date":"2021-11-13","arxiv_id":"2111.07125","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-hardness-analysis-of-thompson-sampling","title":"The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle","date":"2021-11-08","arxiv_id":"2111.04295","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-diverse-combinatorial","title":"Large Scale Diverse Combinatorial Optimization: ESPN Fantasy Football Player Trades","date":"2021-11-04","arxiv_id":"2111.02859","repositories_listed":0,"syntology":null},{"url":null,"slug":"three-dimensional-cooperative-localization-of","title":"Three-dimensional Cooperative Localization of Commercial-Off-The-Shelf Sensors","date":"2021-11-03","arxiv_id":"2111.02040","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-selection-for-fair-and-robust-training","title":"Sample Selection for Fair and Robust Training","date":"2021-10-27","arxiv_id":"2110.14222","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-optimal-decision-trees-using-maxsat","title":"Interpretable Decision Trees Through MaxSAT","date":"2021-10-26","arxiv_id":"2110.13854","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-neural-combinatorial-1","title":"Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness","date":"2021-10-21","arxiv_id":"2110.10942","repositories_listed":0,"syntology":null},{"url":null,"slug":"chaos-inspired-particle-swarm-optimization","title":"Chaos inspired Particle Swarm Optimization with Levy Flight for Genome Sequence Assembly","date":"2021-10-20","arxiv_id":"2110.10623","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-word-is-worth-a-thousand-dollars","title":"A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Meme Stock Prediction","date":"2021-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-memetic-algorithm-for-hard","title":"Learning-based Memetic Algorithm for Hard-label Textual Attack","date":"2021-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-correlation-clustering-with-asymmetric","title":"Robust Correlation Clustering with Asymmetric Noise","date":"2021-10-15","arxiv_id":"2110.08385","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-approximations-for-job-shop-scheduling-a","title":"Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method","date":"2021-10-12","arxiv_id":"2110.06365","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-complexity-analysis-of-evolutionary","title":"Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem","date":"2021-10-10","arxiv_id":"2110.04701","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-power-support-from","title":"Assessing Distribution Network Flexibility via Reliability-based P-Q Area Segmentation","date":"2021-10-03","arxiv_id":"2110.01086","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-attention-lstm-hybrid-model-for-the","title":"An Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-loss-function-search-for-predict","title":"Automatic Loss Function Search for Predict-Then-Optimize Problems with Strong Ranking Property","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-dynamic-attention-model-with-gate","title":"Deep Dynamic Attention Model with Gate Mechanism for Solving Time-dependent Vehicle Routing Problems","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-scaffolding-tree-for-molecule","title":"Differentiable Scaffolding Tree for Molecule Optimization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-adversarial-training-for-neural","title":"Generative Adversarial Training for Neural Combinatorial Optimization Models","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-scenario-representation-for-solving","title":"Learning Scenario Representation for Solving Two-stage Stochastic Integer Programs","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-an-order-fulfillment","title":"Learning to Solve an Order Fulfillment Problem in Milliseconds with Edge-Feature-Embedded Graph Attention","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-combinatorial-optimization-with-1","title":"Neural Combinatorial Optimization with Reinforcement Learning : Solving theVehicle Routing Problem with Time Windows","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-extensions-training-neural-networks","title":"Neural Extensions: Training Neural Networks with Set Functions","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learning-to-solve-cardinality-constrained","title":"On Learning to Solve Cardinality Constrained Combinatorial Optimization in One-Shot: A Re-parameterization Approach via Gumbel-Sinkhorn-TopK","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"preference-conditioned-neural-multi-objective","title":"Preference Conditioned Neural Multi-objective Combinatorial Optimization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-quality-for-efficiency-of-graph","title":"Trading Quality for Efficiency of Graph Partitioning: An Inductive Method across Graphs","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"weavenet-a-differentiable-solver-for-non","title":"WeaveNet: A Differentiable Solver for Non-linear Assignment Problems","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"whats-wrong-with-deep-learning-in-tree-search","title":"What’s Wrong with Deep Learning in Tree Search for Combinatorial Optimization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-scaffolding-tree-for-molecular","title":"Differentiable Scaffolding Tree for Molecular Optimization","date":"2021-09-22","arxiv_id":"2109.10469","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-general-optimal-policies-with-graph","title":"Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits","date":"2021-09-21","arxiv_id":"2109.10129","repositories_listed":0,"syntology":null},{"url":null,"slug":"target-languages-vs-inductive-biases-for","title":"Target Languages (vs. Inductive Biases) for Learning to Act and Plan","date":"2021-09-15","arxiv_id":"2109.07195","repositories_listed":0,"syntology":null},{"url":null,"slug":"simulating-the-effects-of-eco-friendly","title":"Simulating the Effects of Eco-Friendly Transportation Selections for Air Pollution Reduction","date":"2021-09-10","arxiv_id":"2109.04831","repositories_listed":0,"syntology":null},{"url":null,"slug":"dan-decentralized-attention-based-neural","title":"DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem","date":"2021-09-09","arxiv_id":"2109.04205","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-neighborhood-structure-for-job-shop","title":"A new neighborhood structure for job shop scheduling problems","date":"2021-09-07","arxiv_id":"2109.02843","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-combinatorial-optimization-for-word","title":"Efficient Combinatorial Optimization for Word-level Adversarial Textual Attack","date":"2021-09-06","arxiv_id":"2109.02229","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-quality-thermal-gibbs-sampling-with","title":"High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware","date":"2021-09-03","arxiv_id":"2109.01690","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-networks-for-integrated-machine","title":"Optimization Networks for Integrated Machine Learning","date":"2021-09-01","arxiv_id":"2110.00415","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-quasi-concave-set-optimization-a-new","title":"Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity","date":"2021-08-19","arxiv_id":"2108.08758","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-maximize-influence","title":"Maximizing Influence with Graph Neural Networks","date":"2021-08-10","arxiv_id":"2108.04623","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-difficulty-of-generalizing","title":"On the Difficulty of Generalizing Reinforcement Learning Framework for Combinatorial Optimization","date":"2021-08-08","arxiv_id":"2108.03713","repositories_listed":0,"syntology":null},{"url":null,"slug":"uav-trajectory-planning-in-wireless-sensor","title":"UAV Trajectory Planning in Wireless Sensor Networks for Energy Consumption Minimization by Deep Reinforcement Learning","date":"2021-08-01","arxiv_id":"2108.00354","repositories_listed":0,"syntology":null},{"url":null,"slug":"cops-controlled-pruning-before-training","title":"COPS: Controlled Pruning Before Training Starts","date":"2021-07-27","arxiv_id":"2107.12673","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-synchronization-to-partition-power","title":"Utilizing synchronization to partition power networks into microgrids","date":"2021-07-26","arxiv_id":"2107.12165","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-of-human-algorithm-collaboration-in","title":"Power of human-algorithm collaboration in solving combinatorial optimization problems","date":"2021-07-25","arxiv_id":"2107.11784","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-matchings-via-learned-duals","title":"Faster Matchings via Learned Duals","date":"2021-07-20","arxiv_id":"2107.09770","repositories_listed":0,"syntology":null},{"url":null,"slug":"modrl-d-el-multiobjective-deep-reinforcement","title":"MODRL/D-EL: Multiobjective Deep Reinforcement Learning with Evolutionary Learning for Multiobjective Optimization","date":"2021-07-16","arxiv_id":"2107.07961","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-overview-and-experimental-study-of","title":"An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem","date":"2021-07-15","arxiv_id":"2107.07076","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fitness-landscape-view-on-the-tuning-of-an","title":"A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor Design","date":"2021-07-06","arxiv_id":"2107.11201","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-feature-subset-selection-for-big","title":"Scalable Feature Subset Selection for Big Data using Parallel Hybrid Evolutionary Algorithm based Wrapper in Apache Spark","date":"2021-06-26","arxiv_id":"2106.14007","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-reference-alignment-for-sparse-signals","title":"Sparse Multi-Reference Alignment : Phase Retrieval, Uniform Uncertainty Principles and the Beltway Problem","date":"2021-06-24","arxiv_id":"2106.12996","repositories_listed":0,"syntology":null},{"url":null,"slug":"qubo-transformation-using-eigenvalue","title":"QUBO transformation using Eigenvalue Decomposition","date":"2021-06-19","arxiv_id":"2106.10532","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-smt-based-compositional-model-to-solve-a","title":"An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem","date":"2021-06-10","arxiv_id":"2106.07387","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-disaster-containment-via-graph-cut","title":"Fair Disaster Containment via Graph-Cut Problems","date":"2021-06-09","arxiv_id":"2106.05424","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pseudo-backdoors-for-mixed-integer","title":"Learning Pseudo-Backdoors for Mixed Integer Programs","date":"2021-06-09","arxiv_id":"2106.05080","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-robustness-of-neural-networks","title":"Enhancing Robustness of Neural Networks through Fourier Stabilization","date":"2021-06-08","arxiv_id":"2106.04435","repositories_listed":0,"syntology":null}],"record_sha256":"83df32127a12ea020ac9a5d0a1580756b8678e649e62320b500af14f99bdc0bd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}