{"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/10","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":10,"pages_in_order":13,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/combinatorial-optimization/papers/11","papers":[{"url":null,"slug":"experiments-with-graph-convolutional-networks","title":"Experiments with graph convolutional networks for solving the vertex $p$-center problem","date":"2021-06-01","arxiv_id":"2106.00357","repositories_listed":0,"syntology":null},{"url":null,"slug":"policies-for-the-dynamic-traveling-maintainer","title":"Policies for the Dynamic Traveling Maintainer Problem with Alerts","date":"2021-05-31","arxiv_id":"2105.15119","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-combinatorial-optimization-with","title":"On a class of data-driven mixed-integer programming problems under uncertainty: a distributionally robust approach","date":"2021-05-28","arxiv_id":"2105.14139","repositories_listed":0,"syntology":null},{"url":"/paper/ia-gm-a-deep-bidirectional-learning-method","slug":"ia-gm-a-deep-bidirectional-learning-method","title":"IA-GM: A Deep Bidirectional Learning Method for Graph Matching","date":"2021-05-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-a-survey","title":"Graph Learning: A Survey","date":"2021-05-03","arxiv_id":"2105.00696","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-of-convex-polytope","title":"Reconstruction of Convex Polytope Compositions from 3D Point-clouds","date":"2021-04-27","arxiv_id":"2105.02956","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-and-approximate-hierarchical-clustering","title":"Exact and Approximate Hierarchical Clustering Using A*","date":"2021-04-14","arxiv_id":"2104.07061","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-deep-reinforcement-learning-for-3","title":"Distributed Deep Reinforcement Learning for Collaborative Spectrum Sharing","date":"2021-04-06","arxiv_id":"2104.02059","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-programming-to-discover-one-flip","title":"Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems","date":"2021-04-04","arxiv_id":"2104.01709","repositories_listed":0,"syntology":null},{"url":null,"slug":"solo-search-online-learn-offline-for","title":"SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems","date":"2021-04-04","arxiv_id":"2104.01646","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-case-based-reasoning-qcbr","title":"quantum Case-Based Reasoning (qCBR)","date":"2021-04-01","arxiv_id":"2104.00409","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-based-feature-selection-for-efficient","title":"Greedy-Based Feature Selection for Efficient LiDAR SLAM","date":"2021-03-24","arxiv_id":"2103.13090","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-conflicting-constraints-in-solving","title":"Leveraging Conflicting Constraints in Solving Vehicle Routing Problems","date":"2021-03-15","arxiv_id":"2103.08217","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-two-stage-framework-and-reinforcement","title":"A Two-stage Framework and Reinforcement Learning-based Optimization Algorithms for Complex Scheduling Problems","date":"2021-03-10","arxiv_id":"2103.05847","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-engineering-mixed-integer-linear","title":"Knowledge engineering mixed-integer linear programming: constraint typology","date":"2021-02-20","arxiv_id":"2102.12574","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-optimization-and-reasoning-with","title":"Combinatorial optimization and reasoning with graph neural networks","date":"2021-02-18","arxiv_id":"2102.09544","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-thorough-view-of-exact-inference-in-graphs","title":"A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy","date":"2021-02-16","arxiv_id":"2102.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"reversible-action-design-for-combinatorial","title":"Reversible Action Design for Combinatorial Optimization with Reinforcement Learning","date":"2021-02-14","arxiv_id":"2102.07210","repositories_listed":0,"syntology":null},{"url":null,"slug":"relu-neural-networks-for-exact-maximum-flow","title":"ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation","date":"2021-02-12","arxiv_id":"2102.06635","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-combinatorial","title":"Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems","date":"2021-02-11","arxiv_id":"2102.05875","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-percolation-and-numerical-stability","title":"Directed percolation and numerical stability of simulations of digital memcomputing machines","date":"2021-02-06","arxiv_id":"2102.03547","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-training-overhead-portfolios-for","title":"Zero Training Overhead Portfolios for Learning to Solve Combinatorial Problems","date":"2021-02-05","arxiv_id":"2102.03002","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-swarm-optimization-fundamental-study","title":"Particle Swarm Optimization: Fundamental Study and its Application to Optimization and to Jetty Scheduling Problems","date":"2021-01-25","arxiv_id":"2101.11096","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-intermediate-scale-quantum-nisq","title":"Noisy intermediate-scale quantum (NISQ) algorithms","date":"2021-01-21","arxiv_id":"2101.08448","repositories_listed":0,"syntology":null},{"url":null,"slug":"mrna-codon-optimization-on-quantum-comptuers","title":"mRNA Codon Optimization on Quantum Comptuers","date":"2021-01-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-based-antenna-selection-and-csi","title":"Deep Learning based Antenna Selection and CSI Extrapolation in Massive MIMO Systems","date":"2021-01-18","arxiv_id":"2101.06951","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dnn-networks-using-un-rectifying","title":"Learning DNN networks using un-rectifying ReLU with compressed sensing application","date":"2021-01-18","arxiv_id":"2101.06940","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-screening-for-recurrent-diseases-a","title":"Active Screening for Recurrent Diseases: A Reinforcement Learning Approach","date":"2021-01-07","arxiv_id":"2101.02766","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-feature-selection-for-efficient-and","title":"Dynamic Feature Selection for Efficient and Interpretable Human Activity Recognition","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-make-decisions-via-submodular","title":"Learning to Make Decisions via Submodular Regularization","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-multi-robot-task-allocation","title":"Learning to Solve Multi-Robot Task Allocation with a Covariant-Attention based Neural Architecture","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"schedulenet-learn-to-solve-minmax-mtsp-using","title":"ScheduleNet: Learn to Solve MinMax mTSP Using Reinforcement Learning with Delayed Reward","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-pure-exploration-with-full","title":"Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation","date":"2020-12-31","arxiv_id":"2012.15584","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-travelling-thief-problem-based-on","title":"Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation","date":"2020-12-16","arxiv_id":"2012.08888","repositories_listed":0,"syntology":null},{"url":null,"slug":"fixed-priority-global-scheduling-from-a-deep","title":"Fixed Priority Global Scheduling from a Deep Learning Perspective","date":"2020-12-05","arxiv_id":"2012.03002","repositories_listed":0,"syntology":null},{"url":null,"slug":"divide-and-learn-a-divide-and-conquer","title":"Divide and Learn: A Divide and Conquer Approach for Predict+Optimize","date":"2020-12-04","arxiv_id":"2012.02342","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-provider-dynamics-and-coordination-in","title":"Content Provider Dynamics and Coordination in Recommendation Ecosystems","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-submodular-maximization","title":"Dynamic Submodular Maximization","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-injection-locking-in-analog-ising","title":"Distributed Injection-Locking in Analog Ising Machines to Solve Combinatorial Optimizations","date":"2020-11-18","arxiv_id":"2011.09067","repositories_listed":0,"syntology":null},{"url":null,"slug":"modular-multi-target-tracking-using-lstm","title":"Modular Multi Target Tracking Using LSTM Networks","date":"2020-11-16","arxiv_id":"2011.09839","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-knowledge-representation-approach-to","title":"A Knowledge Representation Approach to Automated Mathematical Modelling","date":"2020-11-12","arxiv_id":"2011.06300","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-curriculum-learning-strategies-in","title":"Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization","date":"2020-11-12","arxiv_id":"2011.06188","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-the-family-of-artificial-fish","title":"A Review of the Family of Artificial Fish Swarm Algorithms: Recent Advances and Applications","date":"2020-11-11","arxiv_id":"2011.05700","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-spectral-method-for-unsupervised-multi","title":"A Spectral Method for Unsupervised Multi-Document Summarization","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"storage-placement-policy-for-minimizing","title":"Storage placement policy for minimizing frequency deviation: A combinatorial optimization approach","date":"2020-11-01","arxiv_id":"2011.00492","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-feature-selection-via","title":"Information-theoretic Feature Selection via Tensor Decomposition and Submodularity","date":"2020-10-30","arxiv_id":"2010.16181","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-matrix-factorization-on-special","title":"Binary matrix factorization on special purpose hardware","date":"2020-10-17","arxiv_id":"2010.08693","repositories_listed":0,"syntology":null},{"url":null,"slug":"coco-learning-strategies-for-online-mixed","title":"CoCo: Learning Strategies for Online Mixed-Integer Control","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-latent-search-for-combinatorial","title":"Continuous Latent Search for Combinatorial Optimization","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-large-neighborhood-search","title":"Neural Large Neighborhood Search","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-size-generalization-in-graph-neural-1","title":"From Local Structures to Size Generalization in Graph Neural Networks","date":"2020-10-17","arxiv_id":"2010.08853","repositories_listed":0,"syntology":null},{"url":null,"slug":"virtual-savant-learning-for-optimization","title":"Virtual Savant: learning for optimization","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-circuit-compilation-flow-for","title":"An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm","date":"2020-10-09","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"at-mfcga-an-adaptive-transfer-guided","title":"AT-MFCGA: An Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking","date":"2020-10-08","arxiv_id":"2010.03917","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-algorithm-for-cooperative-semi","title":"An Efficient Algorithm for Cooperative Semi-Bandits","date":"2020-10-05","arxiv_id":"2010.01818","repositories_listed":0,"syntology":null},{"url":null,"slug":"stratlearner-learning-a-strategy-for","title":"StratLearner: Learning a Strategy for Misinformation Prevention in Social Networks","date":"2020-09-29","arxiv_id":"2009.14337","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-size-generalization-in-graph-neural","title":"On Size Generalization in Graph Neural Networks","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-vehicle-routing-with-memory-augmented","title":"Complex Vehicle Routing with Memory Augmented Neural Networks","date":"2020-09-22","arxiv_id":"2009.10520","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-combinatorial-optimization-for-dominating","title":"On combinatorial optimization for dominating sets (literature survey, new models)","date":"2020-09-19","arxiv_id":"2009.09288","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-momentum-uncertainty-hashing","title":"Deep Momentum Uncertainty Hashing","date":"2020-09-17","arxiv_id":"2009.08012","repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-aware-feature-selection-for-iot-device","title":"Cost-aware Feature Selection for IoT Device Classification","date":"2020-09-02","arxiv_id":"2009.01368","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-for-combinatorial","title":"Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art","date":"2020-08-26","arxiv_id":"2008.12646","repositories_listed":0,"syntology":null},{"url":null,"slug":"auxiliary-task-based-deep-reinforcement","title":"Auxiliary-task Based Deep Reinforcement Learning for Participant Selection Problem in Mobile Crowdsourcing","date":"2020-08-25","arxiv_id":"2008.11087","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-reinforcement-learning-for","title":"A Survey on Reinforcement Learning for Combinatorial Optimization","date":"2020-08-17","arxiv_id":"2008.12248","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-deep-reinforcement-learning-1","title":"Multi-Agent Deep Reinforcement Learning enabled Computation Resource Allocation in a Vehicular Cloud Network","date":"2020-08-14","arxiv_id":"2008.06464","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-evolutionary-construction-tree","title":"Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning","date":"2020-08-09","arxiv_id":"2008.03669","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-re-starting-solutions-for-vehicle","title":"Learning (Re-)Starting Solutions for Vehicle Routing Problems","date":"2020-08-08","arxiv_id":"2008.03424","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-preference-elicitation-for","title":"Bayesian preference elicitation for multiobjective combinatorial optimization","date":"2020-07-29","arxiv_id":"2007.14778","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-ant-colony-optimization-via-solution","title":"Boosting Ant Colony Optimization via Solution Prediction and Machine Learning","date":"2020-07-29","arxiv_id":"2008.04213","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-meta-heuristic","title":"Performance Analysis of Meta-heuristic Algorithms for a Quadratic Assignment Problem","date":"2020-07-29","arxiv_id":"2007.14885","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepco-offline-combinatorial-optimization","title":"DeepCO: Offline Combinatorial Optimization Framework Utilizing Deep Learning","date":"2020-07-20","arxiv_id":"2007.09881","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generative-graph-method-to-solve-the","title":"A Generative Graph Method to Solve the Travelling Salesman Problem","date":"2020-07-09","arxiv_id":"2007.04949","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combined-set-covering-and-traveling","title":"Learning Combined Set Covering and Traveling Salesman Problem","date":"2020-07-07","arxiv_id":"2007.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-recent-progress-in-the-theory-of","title":"A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization","date":"2020-06-30","arxiv_id":"2006.16709","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-read-through-machine-teaching","title":"Learning to Read through Machine Teaching","date":"2020-06-30","arxiv_id":"2006.16470","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-minimization-in-uav-aided-networks","title":"Energy Minimization in UAV-Aided Networks: Actor-Critic Learning for Constrained Scheduling Optimization","date":"2020-06-24","arxiv_id":"2006.13610","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-combinatorial-optimization-with","title":"Constrained Combinatorial Optimization with Reinforcement Learning","date":"2020-06-22","arxiv_id":"2006.11984","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-large-scale-distributed-parallel","title":"Practical Massively Parallel Monte-Carlo Tree Search Applied to Molecular Design","date":"2020-06-18","arxiv_id":"2006.10504","repositories_listed":0,"syntology":null},{"url":null,"slug":"logically-synthesized-hardware-accelerated","title":"Logically Synthesized, Hardware-Accelerated, Restricted Boltzmann Machines for Combinatorial Optimization and Integer Factorization","date":"2020-06-16","arxiv_id":"2007.13489","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-networked-control","title":"Application of Monte Carlo Tree Search in Periodic Schedule Design for Networked Control Systems","date":"2020-06-14","arxiv_id":"2006.08015","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-conversion-of-bayesian-network","title":"Decomposed Quadratization: Efficient QUBO Formulation for Learning Bayesian Network","date":"2020-06-12","arxiv_id":"2006.06926","repositories_listed":0,"syntology":null},{"url":null,"slug":"kalman-filter-based-multiple-person-head","title":"Kalman Filter Based Multiple Person Head Tracking","date":"2020-06-11","arxiv_id":"2006.06134","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-and-heuristic-methods-for-the-discrete","title":"Exact and heuristic methods for the discrete parallel machine scheduling location problem","date":"2020-06-09","arxiv_id":"2006.08327","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-minors-meet-machine-learning-the-power","title":"Graph Minors Meet Machine Learning: the Power of Obstructions","date":"2020-06-08","arxiv_id":"2006.04689","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-combinatorial-optimization","title":"Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time","date":"2020-06-06","arxiv_id":"2006.03750","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-tabu-search-algorithm-for-map","title":"Using Tabu Search Algorithm for Map Generation in the Terra Mystica Tabletop Game","date":"2020-06-04","arxiv_id":"2006.02716","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-guarantees-of-local-search","title":"Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions","date":"2020-06-02","arxiv_id":"2006.01400","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combinatorial-solver-for-graph","title":"Learning Combinatorial Solver for Graph Matching","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-behavior-of-inexact-tsp-solvers-and","title":"Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection","date":"2020-05-27","arxiv_id":"2005.13289","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combinatorial-optimization-on-graphs","title":"Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking","date":"2020-05-22","arxiv_id":"2005.11081","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-column-generation-heuristic-for","title":"A Novel Column Generation Heuristic for Airline Crew Pairing Optimization with Large-scale Complex Flight Networks","date":"2020-05-18","arxiv_id":"2005.08636","repositories_listed":0,"syntology":null},{"url":null,"slug":"minereduce-an-approach-based-on-data-mining","title":"MineReduce: an approach based on data mining for problem size reduction","date":"2020-05-15","arxiv_id":"2005.07415","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-based-on-randomized-greedy","title":"A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem","date":"2020-05-05","arxiv_id":"2005.04095","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-layer-local-optima-networks-for-the","title":"Multi-layer local optima networks for the analysis of advanced local search-based algorithms","date":"2020-04-29","arxiv_id":"2004.13936","repositories_listed":0,"syntology":null},{"url":null,"slug":"versatile-black-box-optimization","title":"Versatile Black-Box Optimization","date":"2020-04-29","arxiv_id":"2004.14014","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-we-learn-heuristics-for-graphical-model","title":"Can We Learn Heuristics For Graphical Model Inference Using Reinforcement Learning?","date":"2020-04-27","arxiv_id":"2005.01508","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-of-evolutionary-algorithms","title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","date":"2020-04-22","arxiv_id":"2004.10424","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-to-optimize-the","title":"Reinforcement Learning to Optimize the Logistics Distribution Routes of Unmanned Aerial Vehicle","date":"2020-04-21","arxiv_id":"2004.09864","repositories_listed":0,"syntology":null},{"url":null,"slug":"devolutionary-genetic-algorithms-with","title":"Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem","date":"2020-04-18","arxiv_id":"2004.10048","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-user-pairing-and-association-for","title":"Joint User Pairing and Association for Multicell NOMA: A Pointer Network-based Approach","date":"2020-04-15","arxiv_id":"2004.07395","repositories_listed":0,"syntology":null}],"record_sha256":"fe194c862ea5cd56858794ef690ad1fd3d2f4a01fc2eb11fe318689866846321","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}